Skip to Main content Skip to Navigation
New interface
Preprints, Working Papers, ...

Symmetry of information and nonuniform lower bounds

Abstract : In the first part we provide another proof of the result of [Homer, Mocas 1995] that for all constant c, the class EXP is not included in P/(n^c) . The proof is based on a simple diagonalization, whereas it uses resource-bounded Kolmogorov complexity in [Homer, Mocas 1995]. In the second part, we investigate links between resource-bounded Kolmogorov complexity and nonuniform classes in computational complexity. Assuming a version of polynomial-time symmetry of information, we show that exponential-time problems do not have polynomial-size circuits (in symbols, EXP is not included in P/poly).
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [13 references]  Display  Hide  Download
Contributor : Sylvain Perifel Connect in order to contact the contributor
Submitted on : Monday, June 4, 2007 - 3:40:54 PM
Last modification on : Thursday, September 29, 2022 - 2:58:07 PM
Long-term archiving on: : Friday, November 25, 2016 - 3:47:35 PM


Files produced by the author(s)


  • HAL Id : ensl-00119823, version 2



Sylvain Perifel. Symmetry of information and nonuniform lower bounds. 2007. ⟨ensl-00119823v2⟩



Record views


Files downloads