A note on dense and nondense families of complexity classes
From MaRDI portal
Publication:5619822
DOI10.1007/BF01691468zbMath0216.29103OpenAlexW2054518661MaRDI QIDQ5619822
No author found.
Publication date: 1971
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01691468
Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
Reductions among polynomial isomorphism types, Complexity of algorithms and computations, Two types of properties for complexity measures, Degrees of computational complexity
Cites Work