( en | de | ru )

 

Disambiguation of "Beame, Paul"

Author of the publication

copydeleteadd this publication to your clipboard
The Efficiency of Resolution and Davis--Putnam Procedures.

, , , and . SIAM J. Comput., 31 (4): 1048-1075 (2002)

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

Manfred Paul

Günther Paul

Dorothea Paulick

Wolfgang Paul

 

Other publications of authors with the same name

Counting of Query Expressions: Limitations of Propositional Methods., , , and . ICDT, page 177-188. OpenProceedings.org, (2014)Massively-Parallel Similarity Join, Edge-Isoperimetry, and Distance Correlations on the Hypercube., and . CoRR, (2016)Towards Understanding and Harnessing the Potential of Clause Learning, , and . CoRR, (2011)Optimizing Symbolic Model Checking for Statecharts., , , , , and . IEEE Trans. Software Eng., 27 (2): 170-190 (2001)Time-space trade-off lower bounds for randomized computation of decision problems., , , and . J. ACM, 50 (2): 154-195 (2003)A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of Disjointness., , , and . Comput. Complex., 15 (4): 391-432 (2006)Edge Estimation with Independent Set Oracles., , , , and . CoRR, (2017)A Time-Space Tradeoff for Undirected Graph Traversal by Walking Automata., , , , and . SIAM J. Comput., 28 (3): 1051-1072 (1999)An Exponential Separation Between the Parity Principle and the Pigeonhole Principle., and . Ann. Pure Appl. Log., 80 (3): 195-228 (1996)Special Issue "Conference on Computational Complexity 2008" Guest Editors' Foreword., and . Comput. Complex., 18 (2): 169-170 (2009)