Skip to content

On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages.

Massimiliano Goldwurm, Beatrice Palano, Massimo Santini

VenueASTACS
Year2001
ProceedingsSTACS

Browse the full STACS paper archive.