New Worst-Case Upper Bounds for MAX-2-SAT with Application to MAX-CUT - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Jens Gramm, Edward A. Hirsch, Rolf Niedermeier, Peter Rossmanith. New Worst-Case Upper Bounds for MAX-2-SAT with Application to MAX-CUT. Electronic Colloquium on Computational Complexity (ECCC), 7(37), 2000. [doi]

The following publications are possibly variants of this publication:

Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUTJens Gramm, Edward A. Hirsch, Rolf Niedermeier, Peter Rossmanith. DAM, 130(2):139-155, 2003. [doi]

New Worst-Case Upper Bounds for SATEdward A. Hirsch. JAR, 24(4):397-420, 2000.

Worst-Case Upper BoundsEvgeny Dantsin, Edward A. Hirsch. In Armin Biere, Marijn Heule, Hans van Maaren, Toby Walsh, editors, Handbook of Satisfiability - Second Edition. Volume 336 of Frontiers in Artificial Intelligence and Applications, pages 669-692, IOS Press, 2021. [doi]

Worst-Case Upper BoundsEvgeny Dantsin, Edward A. Hirsch. In Armin Biere, Marijn Heule, Hans van Maaren, Toby Walsh, editors, Handbook of Satisfiability. Volume 185 of Frontiers in Artificial Intelligence and Applications, pages 403-424, IOS Press, 2009. [doi]

runs on WebDSL