On Splitting of a Recursive Set with Polynomial Time Minimal Pairs

DOI10.1002/MALQ.19890350508MaRDI QIDQ3813804zbMATH OpenOpenAlexFDO

Authors Zhi-Xiang Chen

Publication date 1989

Published in Zeitschrift für Mathematische Logik und Grundlagen der Mathematik (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19890350508

zbMATH Keywords

minimal pairpolynomial time reducibilityrecursive setset splittingTuring reducibilities

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4037840
• scientific article; zbMATH DE number 700630
• scientific article; zbMATH DE number 18526
• scientific article; zbMATH DE number 151766
• An Inhomogeneity in the Structure of Karp Degrees

Cited in

(13)

• scientific article; zbMATH DE number 3902038 (Why is no real title available?)
• scientific article; zbMATH DE number 3922634 (Why is no real title available?)
• scientific article; zbMATH DE number 3930984 (Why is no real title available?)
• scientific article; zbMATH DE number 3985202 (Why is no real title available?)
• An Inhomogeneity in the Structure of Karp Degrees
• scientific article; zbMATH DE number 4037840 (Why is no real title available?)
• scientific article; zbMATH DE number 18526 (Why is no real title available?)
• scientific article; zbMATH DE number 65752 (Why is no real title available?)
• scientific article; zbMATH DE number 512826 (Why is no real title available?)
• scientific article; zbMATH DE number 700630 (Why is no real title available?)
• scientific article; zbMATH DE number 205856 (Why is no real title available?)
• Splitting NP-complete sets infinitely
• Minimal pairs for P

This page was built for publication: On Splitting of a Recursive Set with Polynomial Time Minimal Pairs

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