Sciweavers

COCO
2010
Springer
152views Algorithms» more  COCO 2010»
14 years 13 days ago
A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
Derrick Stolee, Chris Bourke, N. V. Vinodchandran
COCO
2010
Springer
107views Algorithms» more  COCO 2010»
14 years 13 days ago
Fooling Functions of Halfspaces under Product Distributions
Parikshit Gopalan, Ryan O'Donnell, Yi Wu, David Zu...
COCO
2010
Springer
153views Algorithms» more  COCO 2010»
14 years 13 days ago
Communication Complexity with Synchronized Clocks
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...
Russell Impagliazzo, Ryan Williams
COCO
2010
Springer
144views Algorithms» more  COCO 2010»
14 years 13 days ago
A Regularity Lemma, and Low-Weight Approximators, for Low-Degree Polynomial Threshold Functions
We give a “regularity lemma” for degree-d polynomial threshold functions (PTFs) over the Boolean cube {−1, 1}n . Roughly speaking, this result shows that every degree-d PTF ...
Ilias Diakonikolas, Rocco A. Servedio, Li-Yang Tan...
COCO
2010
Springer
133views Algorithms» more  COCO 2010»
14 years 13 days ago
Spectral Algorithms for Unique Games
We present a new algorithm for Unique Games which is based on purely spectral techniques, in contrast to previous work in the area, which relies heavily on semidefinite programmi...
Alexandra Kolla
COCO
2010
Springer
135views Algorithms» more  COCO 2010»
14 years 13 days ago
Lower Bounds for Testing Function Isomorphism
—We prove new lower bounds in the area of property testing of boolean functions. Specifically, we study the problem of testing whether a boolean function f is isomorphic to a ...
Eric Blais, Ryan O'Donnell
COCO
2010
Springer
215views Algorithms» more  COCO 2010»
14 years 13 days ago
Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary Pushdown Automata
—We show that every language accepted by a nondeterministic auxiliary pushdown automaton in polynomial time (that is, every language in SAC1 = Log(CFL)) can be accepted by a symm...
Eric Allender, Klaus-Jörn Lange
COCO
2010
Springer
139views Algorithms» more  COCO 2010»
14 years 13 days ago
On Matrix Rigidity and Locally Self-Correctable Codes
We describe a new approach for the problem of finding rigid matrices, as posed by Valiant [Val77], by connecting it to the, seemingly unrelated, problem of proving lower bounds f...
Zeev Dvir
COCO
2010
Springer
136views Algorithms» more  COCO 2010»
14 years 13 days ago
Relationless Completeness and Separations
Pavel Hrubes, Avi Wigderson, Amir Yehudayoff