Toward a Theory of Enumerations
From MaRDI portal
Publication:5585416
DOI10.1145/321510.321525zbMath0191.30801OpenAlexW2044539289MaRDI QIDQ5585416
Publication date: 1969
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321510.321525
Related Items
Splitting theorems for speed-up related to order of enumeration, Reverse complexity, Listing graphs that satisfy first-order sentences, Scalability and the isomorphism problem, A note on dense and nondense families of complexity classes, Speed-Ups by changing the order in which sets are enumerated, Computational speed-up by effective operators, Independence results in computer science?, Infimums of step-counting functions of enumeration of sets, On sets polynomially enumerable by iteration, The complexity of total order structures, Time- and tape-bounded Turing acceptors and AFLs, The enumerability and invariance of complexity classes
