Almost optimal lower bounds for small depth circuits
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Algebraic methods in the theory of lower bounds for Boolean circuit complexity
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
Properties that characterize LOGCFL
Journal of Computer and System Sciences
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
Journal of Computer and System Sciences
Finite automata, formal logic, and circuit complexity
Finite automata, formal logic, and circuit complexity
Indexed Grammars—An Extension of Context-Free Grammars
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
Journal of the ACM (JACM)
On the Structure of Polynomial Time Reducibility
Journal of the ACM (JACM)
On the Tape Complexity of Deterministic Context-Free Languages
Journal of the ACM (JACM)
Automata, Languages, and Machines
Automata, Languages, and Machines
Varieties Of Formal Languages
The Gap-Language-Technique Revisited
CSL '90 Proceedings of the 4th Workshop on Computer Science Logic
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Logspace Optimization Problems and Their Approximability Properties
Theory of Computing Systems
Undirected connectivity in log-space
Journal of the ACM (JACM)
Grammars with macro-like productions
SWAT '68 Proceedings of the 9th Annual Symposium on Switching and Automata Theory (swat 1968)
Complexity of recognition in intermediate Level languages
SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
Congruences for visibly pushdown languages
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
We introduce dense completeness, which gives tighter connection between formal language classes and complexity classes than the usual notion of completeness. A family of formal languages $\mathcal F$ is densely complete in a complexity class $\mathcal C$ iff ${\mathcal F}\subseteq{\mathcal C}$ and for each $C \in{\mathcal C}$ there is an $F \in{\mathcal F}$ such that F is many-one equivalent to C. For AC0-reductions we show the following results: the family CFL of context-free languages is densely complete in the complexity class SAC1. Moreover, we show that the indexed languages are densely complete in NP and the nondeterministic one-counter languages are densely complete in NL. On the other hand, we prove that the regular languages are not densely complete in NC1.