1
Published 2005
Springer Berlin Heidelberg
Table of Contents: ... Unique Choices: Approximating 1-in-k SAT -- Approximating the Distortion -- Approximating the Best-Fit...

2
Published 1998
Springer Berlin Heidelberg
Table of Contents: ... dense subgraphs with semidefinite programming -- Best possible approximation algorithm for MAX SAT...

3
Published 2004
Springer Berlin Heidelberg
Table of Contents: ... Function Supporting Parity Queries over Hypercubes.-Strong Refutation Heuristics for Random k-SAT --...

4
Published 2010
Springer Berlin Heidelberg
Table of Contents: ... Decoding -- Delaying Satisfiability for Random 2SAT -- Improved Rounding for Parallel Repeated Unique Games...

5
Published 2002
Springer Berlin Heidelberg
Table of Contents: ...: An % MathType!MTEF!2!1!+- % feaafiart1ev1aaatCvAUfKttLearuqr1ngBPrgarmWu51MyVXgatC % vAUfeBSjuyZL2yd9gzLbvyNv2...