Publication:4530147

DOI<367::AID-MALQ367>3.0.CO;2-H 10.1002/1521-3870(200204)48:3<367::AID-MALQ367>3.0.CO;2-HzbMath0995.03032MaRDI QIDQ4530147

V. K. Bulitko

Publication date: 7 October 2002

zbMATH Keywords

degree; recursively enumerable sets; sub-Turing reducibilities

Mathematics Subject Classification ID

03D15: Complexity of computation (including implicit computational complexity)

03D25: Recursively (computably) enumerable sets and degrees

03D30: Other degrees and reducibilities in computability and recursion theory

Cites Work

• About Segment Complexity of Turing Reductions
• Unnamed Item
• Unnamed Item