2000•Journal of AlgorithmsRequires access
New Upper Bounds for Maximum Satisfiability
Rolf Niedermeier, Peter Rossmanith
Open publisher page 105 citations
Abstract
This record does not include an abstract. Use the full-text link above if available.
Rolf Niedermeier, Peter Rossmanith
Abstract
An abstract is not available in the OpenAlex record for this paper.
OpenAlex reports 105 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Key concepts: Maximum satisfiability problem, Conjunctive normal form, Satisfiability, Combinatorics, Mathematics, Upper and lower bounds, Boolean satisfiability problem, True quantified Boolean formula