scientific article
From MaRDI portal
Publication:2754147
zbMath0973.68253MaRDI QIDQ2754147
Edward A. Hirsch, Evgeny Dantsin, Uwe Schoening, Andreas Goerdt
Publication date: 11 November 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Complexity of computation (including implicit computational complexity) (03D15)
Related Items
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. ⋮ Worst-case study of local search for MAX-\(k\)-SAT. ⋮ MAX SAT approximation beyond the limits of polynomial-time approximation ⋮ On converting CNF to DNF
This page was built for publication:
