COCO
2008
Springer
13 years 6 months ago
2008
Springer
COCO
2008
Springer
13 years 6 months ago
2008
Springer
We present a new variant of the quantum adversary method. All adversary methods give lower bounds on the quantum query complexity of a function by bounding the change of a progres...
COCO
2008
Springer
13 years 6 months ago
2008
Springer
We prove that the weighted monotone circuit satisfiability problem has no fixed-parameter tractable approximation algorithm with constant or polylogarithmic approximation ratio un...