Sciweavers

STOC
2010
ACM
274views Algorithms» more  STOC 2010»
14 years 1 months ago
Odd Cycle Packing
We study the ratio between the minimum size of an odd cycle vertex transversal and the maximum size of a collection of vertex-disjoint odd cycles in a planar graph. We show that th...
Ken-ichi Kawarabayashi and Bruce Reed
STOC
2010
ACM
204views Algorithms» more  STOC 2010»
14 years 1 months ago
On the Hardness of the Noncommutative Determinant
In this paper we study the computational complexity of computing the noncommutative determinant. We first consider the arithmetic circuit complexity of computing the noncommutativ...
Vikraman Arvind and Srikanth Srinivasan
STOC
2010
ACM
210views Algorithms» more  STOC 2010»
14 years 1 months ago
Recognizing well-parenthesized expressions in the streaming model
Frederic Magniez, Claire Mathieu and Ashwin Nayak
STOC
2010
ACM
184views Algorithms» more  STOC 2010»
14 years 1 months ago
An Invariance Principle For Polytopes
Prahladh Harsha, Adam Klivans and Raghu Meka
STOC
2010
ACM
378views Algorithms» more  STOC 2010»
14 years 1 months ago
On the Geometry of Differential Privacy
Moritz Hardt and Kunal Talwar
STOC
2010
ACM
202views Algorithms» more  STOC 2010»
14 years 1 months ago
How to Compress Interactive Communication
Boaz Barak, Mark Braverman, Xi Chen and Anup Rao
STOC
2010
ACM
244views Algorithms» more  STOC 2010»
14 years 1 months ago
Improving Exhaustive Search Implies Superpolynomial Lower Bounds
The P vs NP problem arose from the question of whether exhaustive search is necessary for problems with short verifiable solutions. We do not know if even a slight algorithmic imp...
Ryan Williams