Sciweavers

TOC
2008
122views more  TOC 2008»
13 years 11 months ago
Derandomizing the Ahlswede-Winter matrix-valued Chernoff bound using pessimistic estimators, and applications
: Ahlswede and Winter [IEEE Trans. Inf. Th. 2002] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound ...
Avi Wigderson, David Xiao
TOC
2008
95views more  TOC 2008»
13 years 11 months ago
On the LP Relaxation of the Asymmetric Traveling Salesman Path Problem
: This is a comment on the article "An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem" by C. Chekuri and M. P
Viswanath Nagarajan
TOC
2008
89views more  TOC 2008»
13 years 11 months ago
Norms, XOR Lemmas, and Lower Bounds for Polynomials and Protocols
Abstract: This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and polynomials over GF(2)....
Emanuele Viola, Avi Wigderson
TOC
2008
71views more  TOC 2008»
13 years 11 months ago
The One-Way Communication Complexity of Hamming Distance
Abstract: Consider the following version of the Hamming distance problem for
T. S. Jayram, Ravi Kumar, D. Sivakumar
TOC
2008
104views more  TOC 2008»
13 years 11 months ago
Single Source Multiroute Flows and Cuts on Uniform Capacity Networks
For an integer h 1, an elementary h-route flow is a flow along h edge disjoint paths between a source and a sink, each path carrying a unit of flow, and a single commodity h-rout...
Henning Bruhn, Jakub Cerný, Alexander Hall,...
TOC
2008
94views more  TOC 2008»
13 years 11 months ago
Optimal lower bounds for the Korkine-Zolotareff parameters of a lattice and for Schnorr's algorithm for the shortest vector prob
Abstract: Schnorr's algorithm for finding an approximation for the shortest nonzero vector in an n-dimensional lattice depends on a parameter k. He proved that for a fixed k ...
Miklós Ajtai
TOC
2008
75views more  TOC 2008»
13 years 11 months ago
A Quantum Algorithm for the Hamiltonian NAND Tree
Abstract: We give a quantum algorithm for the binary NAND tree problem in the Hamiltonian oracle model. The algorithm uses a continuous time quantum walk with a running time propor...
Edward Farhi, Jeffrey Goldstone, Sam Gutmann