scientific article; zbMATH DE number 6606373
From MaRDI portal
Publication:5740444
zbMath1341.68202MaRDI QIDQ5740444
Ashish Sabharwal, Bart Selman, Carla P. Gomes
Publication date: 26 July 2016
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (16)
A Study of Symmetry Breaking Predicates and Model Counting ⋮ Not all bugs are created equal, but robust reachability can tell the difference ⋮ The relative exponential time complexity of approximate counting satisfying assignments ⋮ The Relative Exponential Time Complexity of Approximate Counting Satisfying Assignments ⋮ On the van der Waerden numbers \(\mathrm{w}(2; 3, t)\) ⋮ Projected model counting: beyond independent support ⋮ Automated streamliner portfolios for constraint satisfaction problems ⋮ Solution Counting Algorithms for Constraint-Centered Search Heuristics ⋮ Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting ⋮ Leveraging belief propagation, backtrack search, and statistics for model counting ⋮ Model counting with error-correcting codes ⋮ In search of balance: the challenge of generating balanced Latin rectangles ⋮ Solution counting algorithms for constraint-centered search heuristics ⋮ Variable Influences in Conjunctive Normal Forms ⋮ Unnamed Item ⋮ On the usefulness of linear modular arithmetic in constraint programming
This page was built for publication:
