148 search results - page 8 / 30 » On Perfect Completeness for QMA |
UAI
2004
13 years 9 months ago
2004
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
COCOON
2007
Springer
14 years 1 months ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
AVI
2006
2006
Shakespeare's complete works as a benchmark for evaluating multiscale document navigation techniques
13 years 9 months ago
In this paper, we describe an experimental platform dedicated to the comparative evaluation of multiscale electronic-document navigation techniques. One noteworthy characteristic ...
PIMRC
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract--In this paper, we investigate carrier frequency synchronization in the downlink of 3GPP Long Term Evolution (LTE). A complete carrier frequency offset estimation and comp...
PROVSEC
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. In this paper, we study the soundness amplification by repetition of cryptographic protocols. As a tool, we use the Chernoff Information. We specify the number of attempt...