Solving NP-Complete Problems with Quantum Search (Q5458579): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4542520 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4708561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768314 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4819589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine program for theorem-proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414647 / 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: New methods for 3-SAT decision and worst-case analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting models for 2SAT and 3SAT formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rapid sampling though quantum computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4551211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Maximum Independent Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252376 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Sat and upper bounds on their complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Max 2-Sat: Easier and Faster / rank
 
Normal rank

Latest revision as of 20:23, 27 June 2024

scientific article; zbMATH DE number 5263957
Language Label Description Also known as
English
Solving NP-Complete Problems with Quantum Search
scientific article; zbMATH DE number 5263957

    Statements

    Identifiers