A new lower bound on the maximum number of satisfied clauses in Max-SAT and its algorithmic applications (Q1759685): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solving satisfiability in less than \(2^ n\) steps / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: <i>E</i> <sub>11</sub> and M theory / rank | |||
Normal rank |
Latest revision as of 22:33, 5 July 2024
scientific article; zbMATH DE number 5823282
- A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Application
Language | Label | Description | Also known as |
---|---|---|---|
English | A new lower bound on the maximum number of satisfied clauses in Max-SAT and its algorithmic applications |
scientific article; zbMATH DE number 5823282 |
|
Statements
A new lower bound on the maximum number of satisfied clauses in Max-SAT and its algorithmic applications (English)
0 references
A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Application (English)
0 references
21 November 2012
0 references
7 December 2010
0 references
MaxSAT
0 references
lower bound
0 references
2-satisfiable
0 references
fixed parameter tractable
0 references
kernel
0 references
0 references
0 references