( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A sharp threshold in proof complexity yields lower bounds for satisfiability search.

, , и . J. Comput. Syst. Sci., 68 (2): 238-268 (2004)

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.

Tanja Beament

Christian Paul

Jean Paul

Pauli Paul

Gabriele Paulix

 

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

Model Counting of Query Expressions: Limitations of Propositional Methods., , , и . CoRR, (2013)Decoupling Synchronization from Local Control for Efficient Symbolic Model Checking of Statecharts., , , , , и . ICSE, стр. 142-151. ACM, (1999)Propositional Proof Complexity: Past, Present, and Future., и . Current Trends in Theoretical Computer Science, World Scientific, (2001)Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity., , , и . ICALP, том 4596 из Lecture Notes in Computer Science, стр. 134-145. Springer, (2007)On the Bias of Reed-Muller Codes over Odd Prime Fields., , и . SIAM J. Discret. Math., 34 (2): 1232-1247 (2020)Lower bounds for recognizing small cliques on CRCW PRAM's.. Discret. Appl. Math., 29 (1): 3-20 (1990)Optimal Bounds for the Predecessor Problem and Related Problems., и . J. Comput. Syst. Sci., 65 (1): 38-72 (2002)Stabbing Planes., , , , , , и . Electron. Colloquium Comput. Complex., (2017)Hardness Amplification in Proof Complexity., и . Electron. Colloquium Comput. Complex., (2009)Time-Space Tradeoffs in Resolution: Superpolynomial Lower Bounds for Superlinear Space., , и . Electron. Colloquium Comput. Complex., (2011)