Mathematical Foundations of Computer Science 2003
From MaRDI portal
Publication:5431323
DOI10.1007/b11836zbMath1124.68372OpenAlexW2495578842MaRDI QIDQ5431323
Publication date: 7 December 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b11836
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (12)
On Planar Boolean CSP ⋮ Strong partial clones and the time complexity of SAT problems ⋮ The complexity of approximately counting in 2-spin systems on \(k\)-uniform bounded-degree hypergraphs ⋮ The complexity of approximating bounded-degree Boolean \(\#\)CSP ⋮ Approximating partition functions of bounded-degree Boolean counting constraint satisfaction problems ⋮ A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs ⋮ Colouring, constraint satisfaction, and complexity ⋮ Hybrid Tractable Classes of Constraint Problems ⋮ On the Complexity of Holant Problems ⋮ Approximate counting for complex-weighted Boolean constraint satisfaction problems ⋮ Constant unary constraints and symmetric real-weighted counting constraint satisfaction problems ⋮ On the complexity of paths avoiding forbidden pairs
This page was built for publication: Mathematical Foundations of Computer Science 2003
