scientific article; zbMATH DE number 1747699

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

degreerecursively enumerable setssub-Turing reducibilities

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Cites Work

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

This page was built for publication: