New upper bounds for the problem of maximal satisfiability (Q3225865): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in $\mathcal{O}(2^n)$ Time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: New Bounds for MAX-SAT by Clause Learning / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: New methods for 3-SAT decision and worst-case analysis / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithms for maximum independent sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear-programming design and analysis of fast algorithms for Max 2-CSP / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new algorithm for optimal 2-constraint satisfaction and its implications / rank | |||
Normal rank |
Revision as of 01:16, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | New upper bounds for the problem of maximal satisfiability |
scientific article |
Statements
New upper bounds for the problem of maximal satisfiability (English)
0 references
23 March 2012
0 references
MAX-SAT
0 references
MAX-2-SAT
0 references
upper bounds
0 references
0 references