Author of the publication

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

Threshold Circuits of Small Majority-Depth., and . Inf. Comput., 146 (1): 55-83 (1998)Conditional Lower Bound for a System of Constant-Depth Proofs with Modular Connectives., and . LICS, page 189-200. IEEE Computer Society, (2006)Threshold Circuits for Iterated Multiplication: Using AC0 for Free., and . STACS, volume 665 of Lecture Notes in Computer Science, page 545-565. Springer, (1993)A New Proof of the Weak Pigeonhole Principle., , and . J. Comput. Syst. Sci., 64 (4): 843-872 (2002)Efficient Threshold Circuits for Power Series., and . Inf. Comput., 152 (1): 62-73 (1999)Lifting lower bounds for tree-like proofs., , and . Computational Complexity, 23 (4): 585-636 (2014)Towards lower bounds for bounded-depth Frege proofs with modular connectives., and . Proof Complexity and Feasible Arithmetics, volume 39 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 195-227. DIMACS/AMS, (1996)Circuit Lower Bounds Collapse Relativized Complexity Classes., and . Computational Complexity Conference, page 222-226. IEEE Computer Society, (1999)A new proof of the weak pigeonhole principle., , and . STOC, page 368-377. ACM, (2000)Non-Automatizability of Bounded-Depth Frege Proofs., , , , and . Computational Complexity, 13 (1-2): 47-68 (2004)