COCO   2010 Annual IEEE Conference on Computational Complexity
Wall of Fame | Most Viewed COCO-2010 Paper
215views Algorithms» more  COCO 2010»
13 years 1 months 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
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.
1Download preprint from source215
2Download preprint from source198
3Download preprint from source186
4Download preprint from source180
5Download preprint from source168
6Download preprint from source153
7Download preprint from source152
8Download preprint from source149
9Download preprint from source149
10Download preprint from source148
11Download preprint from source146
12Download preprint from source144
13Download preprint from source139
14Download preprint from source136
15Download preprint from source135
16Download preprint from source133
17Download preprint from source131
18Download preprint from source129
19Download preprint from source125
20Download preprint from source107