Relativized separation of EQP from \(\text{P}^{\text{NP}}\) (Q1607126): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4359455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oracle Quantum Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228473 / 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 Approximation Algorithms for # P / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:05, 4 June 2024

scientific article
Language Label Description Also known as
English
Relativized separation of EQP from \(\text{P}^{\text{NP}}\)
scientific article

    Statements

    Relativized separation of EQP from \(\text{P}^{\text{NP}}\) (English)
    0 references
    0 references
    0 references
    25 July 2002
    0 references
    0 references
    0 references
    0 references
    0 references
    quantum polynomial time
    0 references