Sciweavers

Share
CC
2010
Springer
112views System Software» more  CC 2010»
8 years 2 months ago
Random Cnf's are Hard for the Polynomial Calculus
We show a general reduction that derives lower bounds on degrees of polynomial calculus proofs of tautologies over any field of characteristic other than 2 from lower bounds for r...
Eli Ben-Sasson, Russell Impagliazzo
TIT
2010
111views Education» more  TIT 2010»
8 years 3 months ago
Directly lower bounding the information capacity for channels with I.I.D.deletions and duplications
We directly lower bound the information capacity for channels with i.i.d. deletions and duplications. Our approach differs from previous work in that we focus on the information ca...
Adam Kirsch, Eleni Drinea
TIT
2010
160views Education» more  TIT 2010»
8 years 3 months ago
Bounds on the rate of 2-D bit-stuffing encoders
A method for bounding the rate of bit-stuffing encoders for 2-D constraints is presented. Instead of considering the original encoder, we consider a related one which is quasistati...
Ido Tal, Ron M. Roth
TIT
2010
107views Education» more  TIT 2010»
8 years 3 months ago
Information inequalities for joint distributions, with interpretations and applications
Upper and lower bounds are obtained for the joint entropy of a collection of random variables in terms of an arbitrary collection of subset joint entropies. These inequalities gene...
Mokshay M. Madiman, Prasad Tetali
TAPAS
2011
255views Algorithms» more  TAPAS 2011»
8 years 3 months ago
3-hitting set on Bounded Degree Hypergraphs: Upper and Lower Bounds on the Kernel Size
We study upper and lower bounds on the kernel size for the 3-hitting set problem on hypergraphs of degree at most 3, denoted 33-hs. We first show that, unless P=NP, 3-3-hs on 3-un...
Iyad A. Kanj, Fenghui Zhang
MST
2011
205views Hardware» more  MST 2011»
8 years 3 months ago
Sublinear Time Algorithms for Earth Mover's Distance
We study the problem of estimating the Earth Mover’s Distance (EMD) between probability distributions when given access only to samples of the distributions. We give closeness t...
Khanh Do Ba, Huy L. Nguyen, Huy N. Nguyen, Ronitt ...
ECCC
2011
185views ECommerce» more  ECCC 2011»
8 years 3 months ago
Property Testing Lower Bounds via Communication Complexity
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...
Eric Blais, Joshua Brody, Kevin Matulef
ECCC
2011
188views ECommerce» more  ECCC 2011»
8 years 3 months ago
Three Query Locally Decodable Codes with Higher Correctness Require Exponential Length
Locally decodable codes are error correcting codes with the extra property that, in order to retrieve the correct value of just one position of the input with high probability, it...
Anna Gál, Andrew Mills
DCG
2011
8 years 3 months ago
More Colourful Simplices
We show that any point in the convex hull of each of (d +1) sets of (d +1) points in general position in Rd is contained in at least (d + 1)2/2 simplices with one vertex from each ...
Antoine Deza, Tamon Stephen, Feng Xie
CORR
2010
Springer
162views Education» more  CORR 2010»
8 years 5 months ago
Cross-Composition: A New Technique for Kernelization Lower Bounds
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
Hans L. Bodlaender, Bart M. P. Jansen, Stefan Krat...
books