Polynomial time introreducibility
From MaRDI portal
Publication:1405796
DOI10.1007/s00224-002-1040-zzbMath1024.03042MaRDI QIDQ1405796
Riccardo Silvestri, Patrizio Cintioli
Publication date: 26 August 2003
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-002-1040-z
03D30: Other degrees and reducibilities in computability and recursion theory
Related Items
Degrees of sets having no subsets of higher m- and t t-degree, Sets without subsets of higher many-one degree, Low sets without subsets of higher many-one degree