235 search results - page 30 / 47 » Quantum certificate complexity |
FCT
2007
Springer
14 years 24 days ago
2007
Springer
Abstract. In recent years we have witnessed the proliferation of semidefinite programming bounds in combinatorial optimization [1,5,8], quantum computing [9,2,3,6,4,16] and even in...
APPROX
2008
Springer
13 years 11 months ago
2008
Springer
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
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...
CIE
2007
Springer
14 years 3 months ago
2007
Springer
The intuition guiding the de…nition of computation has shifted over time, a process that is re‡ected in the changing formulations of the Church-Turing thesis. The theory of co...
MAAMAW
1994
Springer
14 years 1 months ago
1994
Springer
What is the relation between the complexity of agents and the complexity of the goals that they can achieve? It is argued on the basis of a fundamental conservation of complexity ...