Almost-everywhere superiority for quantum polynomial time
type: Item
instance of: scholarly article
title: Almost-everywhere superiority for quantum polynomial time
zbMATH Open document ID: 1012.68067
author: Edith Hemaspaandra
author: Lane A. Hemaspaandra
author: Marius Zimand
published in: Information and Computation
publication date: 2003-01-14T00:00:00Z
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 81P68
zbMATH DE Number: 1853266
MaRDI profile type: Publication
full work available at URL: inco.2001.3110
OpenAlex ID: W1999477896
cites work: Almost-everywhere complexity hierarchies for nondeterministic time
cites work: Q4501528
cites work: Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1
cites work: Oracle Quantum Computing
cites work: A note on almost-everywhere-complex sets and separating deterministic- time-complexity classes
cites work: Q3760533
cites work: Q4228473
cites work: Q4249527
cites work: Exponential separation of quantum and classical communication complexity
cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
cites work: On the Power of Quantum Computation
DOI: 10.1006/INCO.2001.3110
description: scientific article; zbMATH DE number 1853266