Polynomial time introreducibility

DOI10.1007/s00224-002-1040-zzbMath1024.03042OpenAlexW2151747524MaRDI 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

zbMATH Keywords

polynomial timecomputation bounded reducibilitiesintroreducibilityunbounded reducibilities

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (3)

Low sets without subsets of higher many-one degree ⋮ Sets without subsets of higher many-one degree ⋮ Degrees of sets having no subsets of higher m- and t t-degree

This page was built for publication: Polynomial time introreducibility