sgen1

DOI10.1145/1671970.1671972zbMath1284.68527OpenAlexW2090435952WikidataQ130963702 ScholiaQ130963702MaRDI QIDQ5406224

I. T. A. Spence

Publication date: 1 April 2014

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1671970.1671972

zbMATH Keywords

SAT-solverssatisfiability benchmarks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in computer science (03B70) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results ⋮ Satisfiability by Maxwell-Boltzmann and Bose-Einstein Statistical Distributions ⋮ MaxSAT Resolution and Subcube Sums

This page was built for publication: sgen1