Automata, Languages and Programming
From MaRDI portal
Publication:5466449
DOI10.1007/B99859zbMath1098.68052OpenAlexW2505584480MaRDI QIDQ5466449
Dmitry Itsykson, Michael Alekhnovich, Edward A. Hirsch
Publication date: 24 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b99859
Analysis of algorithms and problem complexity (68Q25) 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 (2)
A note on SAT algorithms and proof complexity ⋮ A SAT-based parser and completer for pictures specified by tiling
This page was built for publication: Automata, Languages and Programming
