about
Quantum algorithms for algebraic problemsFixed-point quantum search with an optimal number of queries.Quantum Query Complexity of Boolean Functions with Small On-SetsIntricacies of quantum computational pathsOn Exact Quantum Query ComplexityQuantum Search with AdviceSymmetric functions of qubits in an unknown basis
P2860
Q27350179-19CE8CE6-9CBE-490E-AAD1-576D7C163144Q50998950-6B067244-724B-45A8-A6F2-EA89B4DE87A5Q56701651-D0E1F328-67BD-4FE2-81D2-C4EE88C37974Q57696179-9D166CDE-32A5-494F-A3A6-72904C3B5262Q58478263-4E14C72B-C3B8-4323-B564-B81349A6F08EQ58478288-5C437AE9-FDB5-450D-8EF9-E2A47B5A35CBQ58478292-FACED6F4-E99C-49AB-81D4-9E48A844DAFF
P2860
description
article
@en
im Juli 2001 veröffentlichter wissenschaftlicher Artikel
@de
wetenschappelijk artikel
@nl
наукова стаття, опублікована в липні 2001
@uk
ലേഖനം
@ml
name
Quantum lower bounds by polynomials
@en
Quantum lower bounds by polynomials
@nl
type
label
Quantum lower bounds by polynomials
@en
Quantum lower bounds by polynomials
@nl
prefLabel
Quantum lower bounds by polynomials
@en
Quantum lower bounds by polynomials
@nl
P2093
P356
P1433
P1476
Quantum lower bounds by polynomials
@en
P2093
Harry Buhrman
Michele Mosca
Richard Cleve
Robert Beals
Ronald de Wolf
P304
P356
10.1145/502090.502097
P407
P577
2001-07-01T00:00:00Z