On the complexity-relativized strong reducibilities

DOI10.1007/BF01063845zbMATH Open0549.03030MaRDI QIDQ800353

Jari Talja

Publication date: 1983

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

zbMATH Keywords

orderingstrong recursive reducibility classes

Mathematics Subject Classification ID

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

Cites Work

• Strong reducibilities
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Related Items (7)

On the power of deterministic reductions to C=P ⋮ ON RELATIVE COMPLETE REDUCIBILITY ⋮ Title not available (Why is that?) ⋮ Strongly reducing variants of the Krivine abstract machine ⋮ Title not available (Why is that?) ⋮ A solution to Curry and Hindley's problem on combinatory strong reduction ⋮ Title not available (Why is that?)

This page was built for publication: On the complexity-relativized strong reducibilities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q800353)