On the Efficient Generation of Language Instances

DOI10.1137/0219019zbMath0692.68041OpenAlexW2071747565MaRDI QIDQ3034825

Mark A. Fulk, Laura A. Sanchis

Publication date: 1990

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0219019

zbMATH Keywords

generatorconstructorNPoraclessparse languagesPolynomial-time Turing machines

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (4)

On languages accepted with simultaneous complexity bounds and their ranking problem ⋮ On the complexity of test case generation for NP-hard problems ⋮ On the effective generation of set elements within specified ranges ⋮ The complexity of computing maximal word functions

This page was built for publication: On the Efficient Generation of Language Instances