( en | de | ru )

 

Disambiguation of "Beame, Paul"

Author of the publication

copydeleteadd this publication to your clipboard
Towards Understanding and Harnessing the Potential of Clause Learning.

, , and . J. Artif. Intell. Res., (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. You can also use the button next to the name to display some publications already assigned to the person.

Tanja Beament

Christian Paul

Jean Paul

Pauli Paul

Gabriele Paulix

 

Other publications of authors with the same name

Model Counting of Query Expressions: Limitations of Propositional Methods., , , and . CoRR, (2013)Decoupling Synchronization from Local Control for Efficient Symbolic Model Checking of Statecharts., , , , , and . ICSE, page 142-151. ACM, (1999)Propositional Proof Complexity: Past, Present, and Future., and . Current Trends in Theoretical Computer Science, World Scientific, (2001)Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity., , , and . ICALP, volume 4596 of Lecture Notes in Computer Science, page 134-145. Springer, (2007)On the Bias of Reed-Muller Codes over Odd Prime Fields., , and . 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., and . J. Comput. Syst. Sci., 65 (1): 38-72 (2002)Stabbing Planes., , , , , , and . Electron. Colloquium Comput. Complex., (2017)Hardness Amplification in Proof Complexity., and . Electron. Colloquium Comput. Complex., (2009)Time-Space Tradeoffs in Resolution: Superpolynomial Lower Bounds for Superlinear Space., , and . Electron. Colloquium Comput. Complex., (2011)