On the complexity of \(k\)-SAT (Q5943094): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q56018875 / rank
 
Normal rank
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.1006/jcss.2000.1727 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1985572324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental results on the crossover point in random 3-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(2<sup>0.304n</sup>) Algorithm for Solving Maximum Independent Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the complexity of the chromatic number problem / 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: Algorithms for maximum independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4283247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Maximum Independent Set / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:46, 3 June 2024

scientific article; zbMATH DE number 1642222
Language Label Description Also known as
English
On the complexity of \(k\)-SAT
scientific article; zbMATH DE number 1642222

    Statements

    Identifiers