35 search results - page 4 / 7 » stacs 2005 |
STACS
2005
Springer
14 years 28 days ago
2005
Springer
We define and study the complexity of robust polynomials for Boolean functions and the related fault-tolerant quantum decision trees, where input bits are perturbed by noise. We ...
STACS
2005
Springer
14 years 28 days ago
2005
Springer
Abstract. We consider the problem of computing a minimum cycle basis in a directed graph G with m arcs and n vertices. The arcs of G have non-negative weights assigned to them. We ...
STACS
2005
Springer
14 years 28 days ago
2005
Springer
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
STACS
2005
Springer
14 years 28 days ago
2005
Springer
In property testing, we are given oracle access to a function f, and we wish to test if the function satisfies a given property P, or it is ε-far from having that property. In a...
STACS
2005
Springer
14 years 28 days ago
2005
Springer
This paper studies quantum refereed games, which are quantum interactive proof systems with two competing provers: one that tries to convince the verifier to accept and the other...