Titel

Merkliste
1 Ergebnisse

Determining Acceptance Possibility for a Quantum Computatio..:

Fenner, Stephen ; Green, Frederic ; Homer, Steven.
Proceedings: Mathematical, Physical and Engineering Sciences. 455 (1999) 1991 - p. 3953-3966 , 1999

Link: https://www.jstor.org/stable/53541

RT Journal
T1 <Title>Determining Acceptance Possibility for a Quantum Computation is Hard for the Polynomial Hierarchy</Title>

UL https://suche.suub.uni-bremen.de/peid=jstor-53541&Exemplar=1&LAN=DE
				
A1 Fenner, Stephen
A1 Green, Frederic
A1 Homer, Steven
A1 Pruim, Randall
PB The Royal Society
YR 1999
SN 1364-5021
K1 Quantum computing
K1 Complexity theory
K1 Polynomial-time hierarchy
K1 Quantum NP
K1 Applied sciences
K1 Computer science
K1 Computer engineering
K1 Computer technology
K1 Computer systems
K1 Quantum computers
K1 Mathematics
K1 Pure mathematics
K1 Algebra
K1 Polynomials
K1 Theoretical computer science
K1 Turing machines
K1 Mathematical expressions
K1 Mathematical theorems
K1 Discrete mathematics
K1 Number theory
K1 Numbers
K1 Real numbers
K1 Rational numbers
K1 Integers
K1 Physical sciences
K1 Physics
K1 Microphysics
K1 Quantum mechanics
K1 Quantum states
K1 Abstract algebra
K1 Philosophy
K1 Metaphysics
K1 Etiology
K1 Determinism
JF Proceedings: Mathematical, Physical and Engineering Sciences
VO 455
IS 1991
SP 3953
OP 3966
LK http://dx.doi.org/https://www.jstor.org/stable/53541
DO https://www.jstor.org/stable/53541
SF ELIB - SuUB Bremen

Export

RefWorks (nur Desktop-Version!)
Flow (Zuerst in Flow einloggen, dann importieren)