Automata, Languages and Programming

DOI10.1007/b99859zbMath1098.68052MaRDI 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

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

Related Items

A note on SAT algorithms and proof complexity, A SAT-based parser and completer for pictures specified by tiling