On the Efficient Generation of Language Instances
- 1 April 1990
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 19 (2) , 281-296
- https://doi.org/10.1137/0219019
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- The Boolean Hierarchy II: ApplicationsSIAM Journal on Computing, 1989
- The Boolean Hierarchy I: Structural PropertiesSIAM Journal on Computing, 1988
- Complexity Measures for Public-Key CryptosystemsSIAM Journal on Computing, 1988
- How to Generate Factored Random NumbersSIAM Journal on Computing, 1988
- Optimal Approximations and Polynomially Levelable SetsSIAM Journal on Computing, 1986
- Random generation of combinatorial structures from a uniform distributionTheoretical Computer Science, 1986
- Sparse Sets in : RelativizationsSIAM Journal on Computing, 1985
- On sparse sets in NP–PInformation Processing Letters, 1983
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975
- Tally languages and complexity classesInformation and Control, 1974