Author of the publication

Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds.

, , and . STACS, volume 3884 of Lecture Notes in Computer Science, page 455-468. Springer, (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

A Note on the Complexity of Restricted Attribute-Value Grammars, and . CoRR, (1995)Theory of Semi-Feasible Algorithms, and . Monographs in Theoretical Computer Science. An EATCS Series Springer, (2003)The value of agreement a new boosting algorithm., and . J. Comput. Syst. Sci., 74 (4): 557-586 (2008)Diagonalisation methods in a polynomial setting., and . SCT, volume 223 of Lecture Notes in Computer Science, page 330-346. Springer, (1986)P-Selectivity, Immunity, and the Power of One Bit., and . SOFSEM, volume 3831 of Lecture Notes in Computer Science, page 323-331. Springer, (2006)A Hierarchy of Polynomial Kernels., , and . SOFSEM, volume 11376 of Lecture Notes in Computer Science, page 504-518. Springer, (2019)Combined Simplicity and Immunity in Relativized NP., and . STACS, volume 182 of Lecture Notes in Computer Science, page 339-350. Springer, (1985)Two Models for the Reconstruction Problem for Dynamic Data Structures., , , and . Elektronische Informationsverarbeitung und Kybernetik, 25 (4): 131-155 (1989)The Reconstruction and Optimization of Trie Hashing Functions., and . VLDB, page 142-156. Morgan Kaufmann, (1983)Levelable Sets and the Algebraic Structure of Parameterizations., and . CoRR, (2017)