6 search results - page 2 / 2 » Random MAX SAT, random MAX CUT, and their phase transitions |
SIAMCOMP
1998
13 years 4 months ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...