A taxonomy of problems with fast parallel algorithms
Information and Control
Semirings, automata, languages
Semirings, automata, languages
Logarithmic depth circuits for algebraic functions
SIAM Journal on Computing
Log depth circuits for division and related problems
SIAM Journal on Computing
The complexity of Boolean functions
The complexity of Boolean functions
Analytic models and ambiguity of context-free languages
Theoretical Computer Science
Counting problems and algebraic formal power series in noncommuting variables
Information Processing Letters
Effective entropies and data compression
Information and Computation
Information Processing Letters
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
Bounded Length UCFG Equivalence
ISAAC '96 Proceedings of the 7th International Symposium on Algorithms and Computation
Gröbner bases and the defining polynomial of a context-free grammar generating function
Journal of Automata, Languages and Combinatorics
| Hi-index | 0.00 |
The parallel complexity of computing context-free grammar generating series is investigated. It is known that this problem is in DIV, but in terms of n&sgr; rather than n, where n is the index of the desired coefficient and &sgr; is the grammar size. A new method is presented which is in DIV in terms of 22O(&sgr;) &bul; n. Evidence is provided that any direct application of elimination theory to this problem leads to a space and time resource factor that is nearly exponential in grammar size. Copyright 2001 Academic Press.