Generating Difficult CNF Instances in Unexplored Constrainedness Regions
From MaRDI portal
Publication:6039929
DOI10.1145/3385651zbMath1521.68085OpenAlexW3023742384MaRDI QIDQ6039929
Guillaume Escamocher, Barry O'Sullivan, Unnamed Author
Publication date: 23 May 2023
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3385651
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational aspects of satisfiability (68R07)
Related Items
Regular pattern-free coloring ⋮ An interdisciplinary experimental evaluation on the disjunctive temporal problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Chronological backtracking
- Experimental results on the crossover point in random 3-SAT
- Reducibility among Combinatorial Problems
- Collective dynamics of ‘small-world’ networks
- The complexity of satisfiability problems
- Threshold values of random K‐SAT from the cavity method
- The complexity of theorem-proving procedures