148 search results - page 12 / 30 » On Perfect Completeness for QMA |
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We give a fully polynomial randomized approximation scheme to compute a lower bound for the matching polynomial of any weighted graph at a positive argument. For the matching poly...
AUTOMATICA
1999
13 years 7 months ago
1999
The square-root information filter and smoother algorithms have been generalized to handle singular state transition matrices and perfect measurements. This has been done to allow...
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
IJSN
2006
13 years 7 months ago
2006
: In order to conceal their identity and origin, network based intruders seldom attack directly from their own hosts, but rather stage their attacks through intermediate `stepping ...