MAX SAT approximation beyond the limits of polynomial-time approximation
Under an Elsevier user license
open archive
MSC
03B05
03B25
68W25
Keywords
Approximation algorithms
Maximum satisfiability problem
Cited by (0)
- 1
On leave from Steklov Institute of Mathematics. Supported in part by grants from EPSRC and INTAS.
- 2
Supported in part by grants from INTAS and RFBR. Web: http://logic.pdmi.ras.ru/∼hirsch/.
- 3
Supported in part by grants from INTAS and RFBR.
Copyright © 2002 Published by Elsevier B.V.