Complexity and structure
Structural complexity 1
Journal of Computer and System Sciences
On symmetry of information and polynomial time invertibility
Information and Computation
An introduction to Kolmogorov complexity and its applications (2nd ed.)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
Nonuniform Lower Bounds for Exponential Time Classes
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Kolmogorov complexity and derandomization
Kolmogorov complexity and derandomization
Resource bounded symmetry of information revisited
Theoretical Computer Science - Mathematical foundations of computer science 2004
Two theorems on random polynomial time
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
In the first part we provide an elementary proof of the result of Homer and Mocas [3] that for all constant c, the class EXP is not included in P/nc. The proof is based on a simple diagonalization, whereas it uses resource-bounded Kolmogorov complexity in [3]. In the second part, we investigate links between resource-bounded Kolmogorov complexity and nonuniform classes in computational complexity. Assuming a weak version of polynomial-time symmetry of information, we show that exponential-time problems do not have polynomialsize circuits (in symbols, EXP ⊄ P/poly).