Strong and weak reducibility of algorithmic problems

DOI10.3233/COM-150042MaRDI QIDQ2799750zbMATH OpenOpenAlexFDO

Authors Albert A. Muchnik

Publication date 13 April 2016

Published in Computability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/com-150042

zbMATH Keywords

weak reducibilityex-problemsM-problemsweak degrees

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3117565 (Why is no real title available?)
• Recursively enumerable sets of positive integers and their decision problems
• The upper semi-lattice of degrees of recursive unsolvability
• Zur Deutung der intuitionistischen Logik

Cited in

(7)

• Kolmogorov's Calculus of Problems and its Legacy
• Barendregt's problem \#26 and combinatory strong reduction
• A compiled implementation of strong reduction
• scientific article; zbMATH DE number 1408348 (Why is no real title available?)
• scientific article; zbMATH DE number 4126690 (Why is no real title available?)
• Strong polynomial-time reducibility
• scientific article; zbMATH DE number 4119625 (Why is no real title available?)

This page was built for publication: Strong and weak reducibility of algorithmic problems

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