Resolution and linear CNF formulas: improved \((n,3)\)-\textsc{MaxSAT} algorithms (Q2424882): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4511230 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new upper bound for \(( n , 3)\)-MAX-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Parameterized MAX-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution for Max-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved exact algorithms for MAX-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex Cover: Further Observations and Further Improvements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dealing with 4-Variables by Resolution: An Improved MaxSAT Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375757 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: One More Occurrence of Variables Makes Satisfiability Jump from Trivial to NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear CNF formulas and satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplified NP-complete MAXSAT problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unsatisfiable Linear CNF Formulas Are Large and Complex. / rank
 
Normal rank

Revision as of 16:16, 19 July 2024

scientific article
Language Label Description Also known as
English
Resolution and linear CNF formulas: improved \((n,3)\)-\textsc{MaxSAT} algorithms
scientific article

    Statements

    Resolution and linear CNF formulas: improved \((n,3)\)-\textsc{MaxSAT} algorithms (English)
    0 references
    0 references
    0 references
    0 references
    25 June 2019
    0 references
    maximum satisfiability
    0 references
    linear CNF formula
    0 references
    resolution principle
    0 references
    parameterized algorithm
    0 references
    exact algorithm
    0 references

    Identifiers