Login / Signup
Upper Bounds for Quantum Interactive Proofs with Competing Provers.
Gus Gutoski
Published in:
Computational Complexity Conference (2005)
Keyphrases
</>
upper bound
theorem prover
theorem proving
lower bound
upper and lower bounds
tight bounds
worst case
user interaction
data mining
quantum computing
sample complexity
branch and bound
user friendly
first order logic
virtual reality
supervised learning
optimal solution
knapsack problem
computer graphics
lower and upper bounds
decision procedures
genetic algorithm
natural deduction
neural network
quantum inspired
upper bounding