about
Quantum computational supremacy.What can quantum optics say about computational complexity theory?Hardness of classically simulating the one-clean-qubit model.Sufficient Conditions for Efficient Classical Simulation of Quantum OpticsRESEARCH FRONTIERS OF MEMBRANE COMPUTING: OPEN PROBLEMS AND RESEARCH TOPICSP Systems Simulating Oracle Computations
P2860
description
im Oktober 1991 veröffentlichter wissenschaftlicher Artikel
@de
wetenschappelijk artikel
@nl
наукова стаття, опублікована в жовтні 1991
@uk
name
PP is as Hard as the Polynomial-Time Hierarchy
@en
PP is as Hard as the Polynomial-Time Hierarchy
@nl
type
label
PP is as Hard as the Polynomial-Time Hierarchy
@en
PP is as Hard as the Polynomial-Time Hierarchy
@nl
prefLabel
PP is as Hard as the Polynomial-Time Hierarchy
@en
PP is as Hard as the Polynomial-Time Hierarchy
@nl
P356
P1476
PP is as Hard as the Polynomial-Time Hierarchy
@en
P2093
Seinosuke Toda
P304
P356
10.1137/0220053
P407
P577
1991-10-01T00:00:00Z