Quantum approaches to graph colouring (Q1004074): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Quantum computing and hidden variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strengths and Weaknesses of Quantum Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential algorithmic speedup by a quantum walk / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Query Complexity of Some Graph Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The measurement calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3007261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2706552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385515 / rank
 
Normal rank

Revision as of 02:19, 29 June 2024

scientific article
Language Label Description Also known as
English
Quantum approaches to graph colouring
scientific article

    Statements

    Quantum approaches to graph colouring (English)
    0 references
    0 references
    2 March 2009
    0 references
    quantum computing
    0 references
    graph algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references