New Results on the Phase Transition for Random Quantified Boolean Formulas

DOI10.1007/978-3-540-79719-7_5zbMath1138.68534OpenAlexW1507235470MaRDI QIDQ3502691

Nadia Creignou, Raphaël Rossignol, Hervé Daudé, Uwe Egly

Publication date: 27 May 2008

Published in: Theory and Applications of Satisfiability Testing – SAT 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79719-7_5

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Exact location of the phase transition for random (1,2)-QSAT, QBFFam: a tool for generating QBF families from proof complexity

Cites Work

• A threshold for unsatisfiability
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• Asymptotic Estimates of Stirling Numbers
• A General Upper Bound for the Satisfiability Threshold of Randomr-SAT Formulae
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item