COCO 2010 - PDF Preprint Papers

COCO 2010 Annual IEEE Conference on Computational Complexity

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed COCO-2010 Paper

click to vote

COCO
2010
Springer

215views Algorithms» more COCO 2010»

Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary Pushdown Automata

13 years 9 months ago

Download www.cs.rutgers.edu

—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

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	215	Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary Pushdown Automata	claim
2	198	Derandomized Parallel Repetition Theorems for Free Games	claim
3	186	Derandomized Parallel Repetition of Structured PCPs	claim
4	180	Completely Inapproximable Monotone and Antimonotone Parameterized Problems	claim
5	168	A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP	claim
6	153	Communication Complexity with Synchronized Clocks	claim
7	152	A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources	claim
8	149	The Gaussian Surface Area and Noise Sensitivity of Degree-d Polynomial Threshold Functions	claim
9	149	Trade-Off Lower Bounds for Stack Machines	claim
10	148	Derandomizing from Random Strings	claim
11	146	The Partition Bound for Classical Communication Complexity and Query Complexity	claim
12	144	A Regularity Lemma, and Low-Weight Approximators, for Low-Degree Polynomial Threshold Functions	claim
13	139	On Matrix Rigidity and Locally Self-Correctable Codes	claim
14	136	Relationless Completeness and Separations	claim
15	135	Lower Bounds for Testing Function Isomorphism	claim
16	133	Spectral Algorithms for Unique Games	claim
17	131	On the Matching Problem for Special Graph Classes	claim
18	129	On the Relative Strength of Pebbling and Resolution	claim
19	125	On the Power of Randomized Reductions and the Checkability of SAT	claim
20	107	Fooling Functions of Halfspaces under Product Distributions	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers