Almost-everywhere superiority for quantum polynomial time (Q1854537): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Hemaspaandra, Lane A. / rank
 
Normal rank
Property / author
 
Property / author: Marius Zimand / 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/inco.2001.3110 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1999477896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost-everywhere complexity hierarchies for nondeterministic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative to a Random Oracle<i>A</i>, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oracle Quantum Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on almost-everywhere-complex sets and separating deterministic- time-complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3760533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost-everywhere superiority for quantum polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential separation of quantum and classical communication complexity / 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: On the Power of Quantum Computation / rank
 
Normal rank

Latest revision as of 10:14, 5 June 2024

scientific article
Language Label Description Also known as
English
Almost-everywhere superiority for quantum polynomial time
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references