On the effective generation of set elements within specified ranges

DOI10.1007/BF01189853zbMath0779.03010MaRDI QIDQ3141999

Laura A. Sanchis

Publication date: 6 December 1993

Published in: Mathematical Systems Theory (Search for Journal in Brave)

zbMATH Keywords

index setsrecursive functioncomplexity classesrecursively enumerable sets

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Recursive functions and relations, subrecursive hierarchies (03D20)

Cites Work

• Random generation of combinatorial structures from a uniform distribution
• On the Efficient Generation of Language Instances
• Uniform generation of random regular graphs of moderate degree
• EFFICIENT DETECTORS AND CONSTRUCTORS FOR SIMPLE LANGUAGES
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the effective generation of set elements within specified ranges