New Upper Bounds for Maximum Satisfiability
Authors:
- Rolf NiedermeierRNRolf Niedermeier
- Peter RossmanithPRPeter Rossmanith
- 1 July 2000
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 36 (1) , 63-88
Abstract
No abstract availableThis publication has 28 references indexed in Scilit:
- Improved Approximation Algorithms for MAX SATJournal of Algorithms, 2002
- New methods for 3-SAT decision and worst-case analysisTheoretical Computer Science, 1999
- Parameterizing above Guaranteed Values: MaxSat and MaxCutJournal of Algorithms, 1999
- How to find the best approximation resultsACM SIGACT News, 1998
- On Fixed-Parameter Tractability and Approximability of NP Optimization ProblemsJournal of Computer and System Sciences, 1997
- Look AheadTeaching Statistics, 1996
- On the Approximation of Maximum SatisfiabilityJournal of Algorithms, 1994
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991
- Algorithms for maximum independent setsJournal of Algorithms, 1986
- Solving satisfiability in less than 2n stepsDiscrete Applied Mathematics, 1985