STACS 2004
From MaRDI portal
Publication:5309710
DOI10.1007/B96012zbMath1122.68454OpenAlexW4236485840MaRDI QIDQ5309710
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
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (5)
The complexity of pure literal elimination ⋮ Parameterized and subexponential-time complexity of satisfiability problems and applications ⋮ Pure Pointer Programs with Iteration ⋮ Absorbing random walks and the NAE2SAT problem ⋮ Backdoors into Two Occurrences
Uses Software
This page was built for publication: STACS 2004
