Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms
From MaRDI portal
Publication:3434543
DOI10.1007/11758471_9zbMath1183.68305MaRDI QIDQ3434543
Evgeny Dantsin, Alexander Wolpert, Edward A. Hirsch
Publication date: 2 May 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11758471_9
Related Items
Experimental Study of the Shortest Reset Word of Random Automata, Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs, A satisfiability algorithm and average-case hardness for formulas over the full binary basis, A moderately exponential time algorithm for \(k\)-IBDD satisfiability, The complexity of Unique \(k\)-SAT: An isolation lemma for \(k\)-CNFs, A Moderately Exponential Time Algorithm for k-IBDD Satisfiability