PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Pudlák, Pavel"

Author of the publication

copydeleteadd this publication to your clipboard
Lower Bounds for the Polynomial Calculus and the Gröbner Basis Algorithm.

, , and . Computational Complexity, 8 (2): 127-144 (1999)

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.

Pavel Nedvedicky University of Stuttgart

Dr. Pavel Bashtrykov University of Stuttgart

Pavel Denisov University of Stuttgart

Pavel Ruchka University of Stuttgart

 

Other publications of authors with the same name

Quantum deduction rules.. Ann. Pure Appl. Logic, 157 (1): 16-29 (2009)Graph Complexity., , and . Acta Inf., 25 (5): 515-535 (1988)A note on monotone complexity and the rank of matrices., and . Inf. Process. Lett., 87 (6): 321-326 (2003)Models of the Alternative Set Theory., and . J. Symb. Log., 49 (2): 570-585 (1984)Metamathematics of First-Order Arithmetic., and . Perspectives in mathematical logic Springer, (1993)Some combinatorial-algebraic problems from complexity theory., and . Discrete Mathematics, 136 (1-3): 253-279 (1994)A lower bound for DLL algorithms for k-SAT (preliminary version)., and . SODA, page 128-136. ACM/SIAM, (2000)The number of proof lines and the size of proofs in first order logic., and . Arch. Math. Log., 27 (1): 69-84 (1988)Parity Games and Propositional Proofs., , and . ACM Trans. Comput. Log., 15 (2): 17:1-17:30 (2014)A nonlinear bound on the number of wires in bounded depth circuits. Electronic Colloquium on Computational Complexity (ECCC), (2005)