Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Descriptional Complexity of Formal Systems (Draft) Deadline for submissions: April 7 27, 2008(strict)
 

Summary: DCFS
2008
DCFS
2008
Descriptional Complexity of Formal Systems
(Draft) Deadline for submissions: April 7 27, 2008(strict)
Final versions: June 25, 2008
Circuit Complexity, Kolmogorov Complexity, and
Prospects for Lower Bounds
Eric Allender
Department of Computer Science, Rutgers University
Piscataway, NJ 08855, USA
allender@cs.rutgers.edu
Abstract. This invited Descriptional Complexity of Formal Systems lecture
provides an opportunity to raise awareness of the tight connection that exists
between Kolmogorov Complexity and Circuit Complexity, and to argue that
this connection is useful and interesting. Kolmogorov complexity has been used
to provide examples of complete sets for classes such as EXP and PSPACE that
are fundamentally different than the usual complete sets (in the sense that
they are provably not complete under the usual reducibilities). Furthermore,

  

Source: Allender, Eric - Department of Computer Science, Rutgers University

 

Collections: Computer Technologies and Information Sciences