The Sturm-Liouville eigenvalue problem and NP-complete problems in the quantum setting with queries (Q2384174): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3126801 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strengths and Weaknesses of Quantum Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Complexity Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4819589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum integration in Sobolev classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5559978 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quantum query complexity of approximating the median and related statistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2706552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum complexity of integration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4127946 / rank
 
Normal rank

Latest revision as of 08:58, 27 June 2024

scientific article
Language Label Description Also known as
English
The Sturm-Liouville eigenvalue problem and NP-complete problems in the quantum setting with queries
scientific article

    Statements

    The Sturm-Liouville eigenvalue problem and NP-complete problems in the quantum setting with queries (English)
    0 references
    20 September 2007
    0 references
    Complexity
    0 references
    quantum algorithms
    0 references
    approximation
    0 references
    NP complete problems
    0 references

    Identifiers

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