Automata, Languages and Programming
From MaRDI portal
Publication:5466490
DOI10.1007/b99859zbMath1099.68641OpenAlexW2505584480MaRDI QIDQ5466490
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)
Related Items (4)
On the Complexity of Random Satisfiability Problems with Planted Solutions ⋮ Random k -SAT and the power of two choices ⋮ Approximation algorithms for discrete polynomial optimization ⋮ Unnamed Item
This page was built for publication: Automata, Languages and Programming
