Algorithms for Sat and upper bounds on their complexity
From MaRDI portal
Publication:2487388
DOI10.1023/A:1025645221773zbMath1074.68577OpenAlexW190339048MaRDI QIDQ2487388
Edward A. Hirsch, Evgeny Dantsin, S. V. Ivanov, Maxim Vsemirnov
Publication date: 5 August 2005
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1025645221773
Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
Algorithms for four variants of the exact satisfiability problem, Min-wise independent groups, An initial study of time complexity in infinite-domain constraint satisfaction, UnitWalk: A new SAT solver that uses local search guided by unit clause elimination, On complete one-way functions, Solving NP-Complete Problems with Quantum Search, Unnamed Item, A \(2^{|E|/4}\)-time algorithm for MAX-CUT, Hard satisfiable instances for DPLL-type algorithms