scientific article; zbMATH DE number 1500513
From MaRDI portal
Publication:4501528
zbMath0959.68046MaRDI QIDQ4501528
Andris Ambainis, Ronald de Wolf
Publication date: 4 September 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Quantum computation (81P68) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (5)
Beyond quadratic speedups in quantum attacks on symmetric schemes ⋮ Quantum Queries on Permutations with a Promise ⋮ Quantum Queries on Permutations ⋮ Complexity measures and decision tree complexity: a survey. ⋮ Almost-everywhere superiority for quantum polynomial time
This page was built for publication:
