Worst-case study of local search for MAX-\(k\)-SAT. (Q1408379): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4952605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4511230 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic aspects in speech recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247437 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3931248 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754147 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine program for theorem-proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / 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: Q2728900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375757 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the maximum satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New worst-case upper bounds for SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: SAT local search algorithms: Worst-case study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4475671 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search algorithms for SAT: an empirical evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375773 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterizing above Guaranteed Values: MaxSat and MaxCut / 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: New Upper Bounds for Maximum Satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved exponential-time algorithm for <i>k</i> -SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375767 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Approximation of Maximum Satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542575 / rank
 
Normal rank

Latest revision as of 11:11, 6 June 2024

scientific article
Language Label Description Also known as
English
Worst-case study of local search for MAX-\(k\)-SAT.
scientific article

    Statements

    Worst-case study of local search for MAX-\(k\)-SAT. (English)
    0 references
    0 references
    15 September 2003
    0 references
    0 references
    MAX-SAT
    0 references
    Schöning algorithm
    0 references
    Papadimitriou algorithm
    0 references
    0 references
    0 references
    0 references
    0 references