STACS 2004
From MaRDI portal
Publication:5309695
DOI10.1007/b96012zbMath1122.68590OpenAlexW4236485840MaRDI QIDQ5309695
Edward A. Hirsch, Alexander Wolpert, Evgeny Dantsin
Publication date: 1 October 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b96012
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (8)
An improved upper bound for SAT ⋮ A Moderately Exponential Time Algorithm for k-IBDD Satisfiability ⋮ A satisfiability algorithm and average-case hardness for formulas over the full binary basis ⋮ A moderately exponential time algorithm for \(k\)-IBDD satisfiability ⋮ Satisfiability of mixed Horn formulas ⋮ On Some Aspects of Mixed Horn Formulas ⋮ An algorithm for exact satisfiability analysed with the number of clauses as parameter ⋮ Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs
This page was built for publication: STACS 2004
