Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables.

Published in: Inf. Process. Lett. (2000)

Keyphrases

black box
lower bound
boolean variables
black boxes
upper bound
worst case
white box
np hard
computational complexity
orders of magnitude
integration testing
branch and bound
test cases
branch and bound algorithm
decision problems
boolean formula
databases
relational databases
objective function