 | 2012 |
|---|
| 5 |       | Eric Allender,
George Davie,
Luke Friedman,
Samuel Hopkins,
Iddo Tzameret:
Kolmogorov Complexity, Circuits, and the Strength of Formal Theories of Arithmetic.
Electronic Colloquium on Computational Complexity (ECCC) 19: 28 (2012) |
| 4 | | Eric Allender,
Harry Buhrman,
Luke Friedman,
Bruno Loff:
Reductions to the set of random strings: the resource-bounded case.
Electronic Colloquium on Computational Complexity (ECCC) 19: 54 (2012) |
| 2011 |
|---|
| 3 | | Eric Allender,
Luke Friedman,
William I. Gasarch:
Limits on the Computational Power of Random Strings.
ICALP (1) 2011: 293-304 |
| 2010 |
|---|
| 2 | | Eric Allender,
Luke Friedman,
William I. Gasarch:
Exposition of the Muchnik-Positselsky Construction of a Prefix Free Entropy Function that is not Complete under Truth-Table Reductions.
Electronic Colloquium on Computational Complexity (ECCC) 17: 138 (2010) |
| 1 | | Eric Allender,
Luke Friedman,
William I. Gasarch:
Limits on the Computational Power of Random Strings.
Electronic Colloquium on Computational Complexity (ECCC) 17: 139 (2010) |
Data released under the ODC-BY 1.0 license — See also our legal information page