Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Derandomization and Distinguishing Complexity Eric Allender
 

Summary: Derandomization and Distinguishing Complexity
Eric Allender£
Rutgers University
allender@cs.rutgers.edu
Michal Kouck´y£
Rutgers University
mkoucky@paul.rutgers.edu
Detlef Ronneburger£
Rutgers University
detlef@paul.rutgers.edu
Sambuddha Roy£
Rutgers University
samroy@paul.rutgers.edu
Abstract
We continue an investigation of resource-bounded Kol-
mogorov complexity and derandomization techniques begun
in [2, 3].
We introduce nondeterministic time-bounded Kolmogorov
complexity measures (KNt and KNT) and examine the
properties of these measures using constructions of hitting

  

Source: Allender, Eric - Department of Computer Science, Rutgers University
Kouckı, Michal - Institute of Mathematics, Academy of Sciences of the Czech Republic

 

Collections: Computer Technologies and Information Sciences; Mathematics