A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search. (Q1853552): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Ravindran Kannan / rank | |||
Property / author | |||
Property / author: Jon M. Kleinberg / rank | |||
Property / author | |||
Property / author: Uwe Schoening / rank | |||
Property / author | |||
Property / author: Ravindran Kannan / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Jon M. Kleinberg / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Uwe Schoening / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q57904544 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5516510 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4004338 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4342497 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4525695 / 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: On the greedy algorithm for satisfiability / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4375761 / 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: Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems / 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: An improved exponential-time algorithm for <i>k</i> -SAT / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4484662 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Number of models and satisfiability of sets of clauses / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0304-3975(01)00174-8 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2171680292 / rank | |||
Normal rank |
Latest revision as of 11:01, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search. |
scientific article |
Statements
A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search. (English)
0 references
21 January 2003
0 references
0 references