152 search results - page 12 / 31 » Robust Polynomials and Quantum Algorithms |
STOC
2000
ACM
14 years 24 days ago
2000
ACM
We consider the design of self-testers for quantum gates. A self-tester for the gates F 1, . . . , F m is a procedure that, given any gates G1, . . . , Gm, decides with high probab...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
Quantum effects are a natural phenomenon and just like evolution, or immune processes, can serve as an inspiration for the design of computing algorithms. This study illustrates ...
FCT
2005
Springer
14 years 1 months ago
2005
Springer
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
COCO
2005
Springer
14 years 2 months ago
2005
Springer
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
AUTOMATICA
2008
13 years 8 months ago
2008
A wide variety of stability and performance questions about linear dynamical systems can be reformulated as convex optimization problems involving linear matrix inequalities (LMIs...