On the complexity-relativized strong reducibilities

DOI10.1007/BF01063845zbMath0549.03030MaRDI QIDQ800353

Jari Talja

Publication date: 1983

Published in: Studia Logica (Search for Journal in Brave)

zbMATH Keywords

ordering; strong recursive reducibility classes

Mathematics Subject Classification ID

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

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

Cites Work

• Strong reducibilities
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item