Approximating satisfiable satisfiability problems

DOI10.1007/s004530010035zbMath0959.68051OpenAlexW2126331452MaRDI QIDQ1578395

N. Delaunay

Publication date: 27 August 2000

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004530010035

zbMATH Keywords

maximum satisfiability problemMAX SAT

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (4)

A nonmonotone GRASP ⋮ The Quest for Strong Inapproximability Results with Perfect Completeness ⋮ Tight bound on Johnson's algorithm for maximum satisfiability ⋮ A refined branching algorithm for the maximum satisfiability problem

This page was built for publication: Approximating satisfiable satisfiability problems