Mathematical Foundations of Computer Science 2003
From MaRDI portal
Publication:5431323
DOI10.1007/b11836zbMath1124.68372MaRDI 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
68Q25: Analysis of algorithms and problem complexity
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Hybrid Tractable Classes of Constraint Problems, On the Complexity of Holant Problems, 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, A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs, Colouring, constraint satisfaction, and complexity, Approximate counting for complex-weighted Boolean constraint satisfaction problems, On the complexity of paths avoiding forbidden pairs, The complexity of approximating bounded-degree Boolean \(\#\)CSP, Approximating partition functions of bounded-degree Boolean counting constraint satisfaction problems, Constant unary constraints and symmetric real-weighted counting constraint satisfaction problems, On Planar Boolean CSP
