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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-540-78773-0_6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1488940485 / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

Latest revision as of 20: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

    Identifiers