A simpler exponential-time approximation algorithm for MAX-k-SAT

From MaRDI portal

A simpler exponential-time approximation algorithm for MAX-\(k\)-SAT

Jump to:navigation, search

DOI10.1137/1.9781611978964.18MaRDI QIDQ7292280zbMATH OpenFDO

Authors Harry Buhrman, Sevag Gharibian, Zeph A. Landau, François Le Gal, Norbert Schuch, Suguru Tamaki

Publication date 8 July 2026

Full work available at URL https://doi.org/10.1137/1.9781611978964.18

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: A simpler exponential-time approximation algorithm for MAX-\(k\)-SAT

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7292280)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=A_simpler_exponential-time_approximation_algorithm_for_MAX-%5C(k%5C)-SAT&oldid=104642575"