scientific article; zbMATH DE number 62443

MaRDI QIDQ4010140zbMATH OpenFDO

Authors Xizhong Zheng

Publication date 27 September 1992

zbMATH Keywords

P=?NPpositive and negative degrees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 3978381
• P, NP, and the Post correspondence problem
• scientific article; zbMATH DE number 7683979
• scientific article; zbMATH DE number 5787962
• Publication:4934293
• Honest polynomial degrees and \(P=?NP\)
• On the P vs NP question: a proof of inequality
• Honest polynomial time reducibilities and the \(P=?NP\) problem
• scientific article; zbMATH DE number 3869313
• To the problem P=?NP

Cited in

(12)

• Differences between resource bounded degree structures
• Inhomogeneities in the polynomial-time degrees: The degrees of super sparse sets
• scientific article; zbMATH DE number 5787962 (Why is no real title available?)
• scientific article; zbMATH DE number 3869313 (Why is no real title available?)
• All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size
• scientific article; zbMATH DE number 3987265 (Why is no real title available?)
• scientific article; zbMATH DE number 850635 (Why is no real title available?)
• scientific article; zbMATH DE number 7676615 (Why is no real title available?)
• scientific article; zbMATH DE number 7683979 (Why is no real title available?)
• scientific article; zbMATH DE number 4137760 (Why is no real title available?)
• Is there a logic for polynomial time?
• scientific article; zbMATH DE number 218550 (Why is no real title available?)

This page was built for publication:

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