On the effective generation of set elements within specified ranges

DOI10.1007/BF01189853MaRDI QIDQ3141999zbMATH OpenFDO

Authors Laura A. Sanchis

Publication date 6 December 1993

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

Full work available at URL https://doi.org/10.1007/BF01189853

zbMATH Keywords

complexity classesindex setsrecursive functionrecursively enumerable sets

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 553907
• scientific article; zbMATH DE number 1929969
• On the construction of effectively random sets
• Generating combinatorial sets with given properties
• Generating All Sets With Bounded Unions
• scientific article; zbMATH DE number 3993648
• scientific article; zbMATH DE number 841574
• Algorithms and Computation
• Generating subsets on a systolic array
• scientific article; zbMATH DE number 1208725

Cites work

• EFFICIENT DETECTORS AND CONSTRUCTORS FOR SIMPLE LANGUAGES
• scientific article; zbMATH DE number 4091484 (Why is no real title available?)
• scientific article; zbMATH DE number 3654183 (Why is no real title available?)
• scientific article; zbMATH DE number 3748431 (Why is no real title available?)
• scientific article; zbMATH DE number 15884 (Why is no real title available?)
• On the Efficient Generation of Language Instances
• Random generation of combinatorial structures from a uniform distribution
• Uniform generation of random regular graphs of moderate degree

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3141999)