Speed-ups by changing the order in which sets are enumerated (Preliminary Version)

DOI10.1145/800169.805424zbMath1283.03076OpenAlexW2085040191MaRDI QIDQ5402508

P. R. Young

Publication date: 14 March 2014

Published in: Proceedings of the first annual ACM symposium on Theory of computing - STOC '69 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/800169.805424

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Recursively (computably) enumerable sets and degrees (03D25)

Related Items

Speed-Ups by changing the order in which sets are enumerated