On Moderately Exponential Time for SAT

DOI10.1007/978-3-642-14186-7_27zbMath1306.68043OpenAlexW1604399776WikidataQ57568004 ScholiaQ57568004MaRDI QIDQ4930599

Alexander Wolpert, Evgeny Dantsin

Publication date: 29 September 2010

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

Full work available at URL: https://doi.org/10.1007/978-3-642-14186-7_27

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (2)

Matching Triangles and Basing Hardness on an Extremely Popular Conjecture ⋮ Fixed-Parameter Tractability of Treewidth and Pathwidth

This page was built for publication: On Moderately Exponential Time for SAT