FAQ

Pierluigi Crescenzi

Pierluigi Crescenzi (a.k.a. Pilu Crescenzi) is a full professor of computer science at the University of Florence (Italy). His research areas include… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1998-2010
0119982010

Related topics

Related topics

4 relations
Computational complexity theoryComputer programmingComputer scienceTheoretical computer science

Related mentions per year

Related mentions per year

1942-2018
19401960198020002020
Pierluigi Crescenzi
Computational complexity theory
Computer science
Computer programming
Theoretical computer science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
UNIVERSITE PARIS.DIDEROT (PARIS 7) Ecole Doctorale de Sciences Mathématiques de Paris Centre DOCTORAT
  • Alina Mihaela STOICA
  • 2010
Analyse de la structure locale des grands réseaux sociaux Analyzing the local structure of large social networks Soutenue le 12… (More)
  • figure 3.3
  • figure 3.4
  • figure 3.5
  • figure 3.6
  • figure 3.7
Is this relevant?
Review
2006
Review
2006
Sigact News Complexity Theory Column 52 Bovet and Crescenzi's Complexity Textbook Is Again Available Guest Column: Recent Work on Hierarchies for Semantic Classes
We survey time hierarchies, with an emphasis on recent work on hierarchies for semantic classes. 
Is this relevant?
2006
2006
SIGACT news complexity theory column 52
For those who are big fans of the fantastic complexity textbook by Daniel Bovet and Pierluigi Crescenzi [BC93] (and I myself… (More)
Is this relevant?
Review
2005
Review
2005
Combinatorial approximation algorithms: a comparative review
This paper is a comparative review of three related books: Giorgio Ausiello, Pierluigi Crescenzi, Giorgio Gambosi, Viggo Kann… (More)
Is this relevant?
2003
2003
Résumés des cours et exposés
Heribert Vollmer : Boolean functions and Post’s lattice with applications to complexity theory. A Boolean functions f can be… (More)
Is this relevant?
1998
1998
Compilation of Intractable Problems and Its Application to Artificial Intelligence
Intractable problems are hard to solve. Since the work “has to be done”, various solutions have been developed. The two classical… (More)
  • table 1.1
  • figure 1.1
  • figure 2.1
  • figure 2.2
  • figure 2.3
Is this relevant?