Author of the publication

Comparing Phase Transitions and Peak Cost in PP-Complete Satisfiability Problems.

, , and . AAAI/IAAI, page 620-626. AAAI Press / The MIT Press, (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.

 

Other publications of authors with the same name

Learnability of quantified formulas., and . Theor. Comput. Sci., 306 (1-3): 485-511 (2003)A Combinatorial Characterization of Resolution Width, and . Electron. Colloquium Comput. Complex., (2002)Towards a Characterization of Constant-Factor Approximable Min CSPs., , and . SODA, page 847-857. SIAM, (2015)Learnability of Relatively Quantified Generalized Formulas., , and . ALT, volume 3244 of Lecture Notes in Computer Science, page 365-379. Springer, (2004)Dismantlability, Connectedness, and Mixing in Relational Structures., , , and . ICALP, volume 132 of LIPIcs, page 29:1-29:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Looking Algebraically at Tractable Quantified Boolean Formulas., and . SAT, (2004)Right-Adjoints for Datalog Programs., , and . ICDT, volume 290 of LIPIcs, page 10:1-10:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)A Simple Algorithm for Mal'tsev Constraints., and . SIAM J. Comput., 36 (1): 16-27 (2006)Towards a Characterization of Constant-Factor Approximable Finite-Valued CSPs., , and . CoRR, (2016)Learning schema mappings., , and . ICDT, page 182-195. ACM, (2012)