Guided Search and a Faster Deterministic Algorithm for 3-SAT (Q5458517): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4252729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved local search algorithm for 3-SAT / 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: Solving satisfiability in less than \(2^ n\) steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3507036 / rank
 
Normal rank

Latest revision as of 21:22, 27 June 2024

scientific article; zbMATH DE number 5263896
Language Label Description Also known as
English
Guided Search and a Faster Deterministic Algorithm for 3-SAT
scientific article; zbMATH DE number 5263896

    Statements