A taxonomy of problems with fast parallel algorithms
Information and Control
Random generation of combinatorial structures from a uniform
Theoretical Computer Science
Problems complete for deterministic logarithmic space
Journal of Algorithms
The complexity of Boolean functions
The complexity of Boolean functions
Efficient parallel evaluation of straight-line code and arithmetic circuits
SIAM Journal on Computing
Monte-Carlo approximation algorithms for enumeration problems
Journal of Algorithms
Approximate counting, uniform generation and rapidly mixing Markov chains
Information and Computation
Counting problems and algebraic formal power series in noncommuting variables
Information Processing Letters
The complexity of computing the number of strings of given length in context-free languages
Theoretical Computer Science
The computational linguistics of biological sequences
Artificial intelligence and molecular biology
A calculus for the random generation of labelled combinatorial structures
Theoretical Computer Science
The complexity of computing maximal word functions
Computational Complexity
Uniform random generation of words of rational languages
Theoretical Computer Science - Special issue: selected papers from “GASCOM '94” and the “Polyominoes and Tilings” workshops
A quasi-polynomial-time algorithm for sampling words from a context-free language
Information and Computation
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
Journal of the ACM (JACM)
Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
On one-way auxiliary pushdown automata
Proceedings of the 3rd GI-Conference on Theoretical Computer Science
| Hi-index | 0.00 |
We study the circuit complexity of generating at random a word of length n from a given language under uniform distribution. We prove that, for every language accepted in polynomial time by 1-NAuxPDA of polynomially bounded ambiguity, the problem is solvable by a logspace-uniform family of probabilistic boolean circuits of polynomial size and O(log2 n) depth. Using a suitable notion of reducibility (similar to the NC1-reducibility), we also show the relationship between random generation problems for regular and context-free languages and classical computational complexity classes such as DIV, L and DET.