( en | de | ru )

 

Disambiguation of "Pudlák, Pavel"

Author of the publication

copydeleteadd this publication to your clipboard
Boolean Circuits, Tensor Ranks, and Communication Complexity.

, , and . SIAM J. Comput., 26 (3): 605-633 (1997)

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.

Jonas Philipp Pavelka

Wieland Werther Pavel

Luciana Pavel

Ji Pavelka

Dietrich Pavel

 

Other publications of authors with the same name

A lower bound for DLL algorithms for k-SAT (preliminary version)., and . SODA, page 128-136. ACM/SIAM, (2000)A note on monotone complexity and the rank of matrices., and . Inf. Process. Lett., 87 (6): 321-326 (2003)Metamathematics of First-Order Arithmetic., and . Perspectives in mathematical logic Springer, (1993)Models of the Alternative Set Theory., and . J. Symb. Log., 49 (2): 570-585 (1984)On extracting computations from propositional proofs (a survey).. FSTTCS, volume 8 of LIPIcs, page 30-41. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)Quantum deduction rules.. Ann. Pure Appl. Log., 157 (1): 16-29 (2009)On the complexity of finding falsifying assignments for Herbrand disjunctions.. CoRR, (2014)Parity Games and Propositional Proofs., , and . ACM Trans. Comput. Log., 15 (2): 17:1-17:30 (2014)Santha-Vazirani sources, deterministic condensers and very strong extractors., and . Theory Comput. Syst., 64 (6): 1140-1154 (2020)Graph Complexity., , and . Acta Inf., 25 (5): 515-535 (1988)