400 search results - page 1 / 80 » Derandomization and Distinguishing Complexity |
70
Voted
COCO
2003
Springer
15 years 2 months ago
2003
Springer
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov comple...
FSTTCS
2004
Springer
15 years 2 months ago
2004
Springer
We consider hypotheses about nondeterministic computation that have been studied in different contexts and shown to have interesting consequences: • The measure hypothesis: NP d...
100
click to vote
ECCC
2011
14 years 4 months ago
2011
We revisit the notion of a targeted canonical derandomizer, introduced in our recent ECCC Report (TR10-135) as a uniform notion of a pseudorandom generator that suffices for yield...
CC
2008
Springer
14 years 9 months ago
2008
Springer
We use derandomization to show that sequences of positive pspace-dimension
FSTTCS
2001
Springer
15 years 1 months ago
2001
Springer
This paper has the following goals: – To survey some of the recent developments in the field of derandomization. – To introduce a new notion of time-bounded Kolmogorov complex...