Algorithms and Computation
From MaRDI portal
Publication:5897897
DOI10.1007/11602613zbMath1175.68208OpenAlexW2304246803MaRDI QIDQ5897897
Publication date: 14 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11602613
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
An improved upper bound for SAT ⋮ An improved exact algorithm for the domatic number problem ⋮ Further improvements for SAT in terms of formula length ⋮ An Improved Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes ⋮ Unnamed Item ⋮ New and improved algorithms for unordered tree inclusion ⋮ Determining a singleton attractor of an AND/OR Boolean network in \(O(n^{1.587})\) time ⋮ A fast algorithm for SAT in terms of formula length