Self-P-Printability and Polynomial Time Turing Equivalence to a Tally Set

DOI10.1137/0220064zbMath0737.68034OpenAlexW2164910152MaRDI QIDQ3985806

Roy S. Rubinstein

Publication date: 27 June 1992

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0220064

zbMATH Keywords

sparse setstally setsP-printable sets

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

This page was built for publication: Self-P-Printability and Polynomial Time Turing Equivalence to a Tally Set