Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
The Pervasive Reach of Resource-Bounded Kolmogorov Complexity in Computational Complexity Theory
 

Summary: The Pervasive Reach of Resource-Bounded Kolmogorov
Complexity in Computational Complexity Theory
Eric Allender
Rutgers University
Piscataway, NJ, USA
allender@cs.rutgers.edu
Michal Kouck´y
Institute of Mathematics of the Academy of Sciences of the Czech Republic
Prague, Czech Republic
koucky@math.cas.cz
Detlef Ronneburger§
Bloomberg LP
dronneburger@bloomberg.net
Sambuddha Roy
India Research Laboratory, IBM, New Delhi, India
sambuddha@in.ibm.com
Much of this material appeared in preliminary form as "Derandomization and Distinguishing Complexity" in the proceedings of the 2003
IEEE Conference on Computational Complexity [AKRR03].
Partially supported by NSF grants DMS-0652582, CCF-0830133, and CCF-0832787. Some of this work was performed while this author
was a visiting scholar at the University of Cape Town.

  

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

 

Collections: Computer Technologies and Information Sciences