( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Lower Bounds for the Polynomial Calculus and the Groebner Basis Algorithm

, , и . Electron. Colloquium Comput. Complex., (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.

Dietrich Pavel

Jonas Philipp Pavelka

Wieland Werther Pavel

Luciana Pavel

Ji Pavelka

 

Другие публикации лиц с тем же именем

A lower bound for DLL algorithms for k-SAT (preliminary version)., и . SODA, стр. 128-136. ACM/SIAM, (2000)Parity Games and Propositional Proofs., , и . ACM Trans. Comput. Log., 15 (2): 17:1-17:30 (2014)Two lower bounds for branching programs, , , , , , , и . STOC, стр. 30-38. ACM, (1986)Some Consequences of Cryptographical Conjectures for S_2^1 and EF., и . LCC, том 960 из Lecture Notes in Computer Science, стр. 210-220. Springer, (1994)Santha-Vazirani sources, deterministic condensers and very strong extractors., и . Theory Comput. Syst., 64 (6): 1140-1154 (2020)On extracting computations from propositional proofs (a survey).. FSTTCS, том 8 из LIPIcs, стр. 30-41. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)Quantum deduction rules.. Ann. Pure Appl. Log., 157 (1): 16-29 (2009)Models of the Alternative Set Theory., и . J. Symb. Log., 49 (2): 570-585 (1984)Metamathematics of First-Order Arithmetic., и . Perspectives in mathematical logic Springer, (1993)On the complexity of finding falsifying assignments for Herbrand disjunctions.. CoRR, (2014)