scientific article; zbMATH DE number 62443
From MaRDI portal
Publication:4010140
zbMATH Open0792.68066MaRDI QIDQ4010140FDOQ4010140
Authors: Xizhong Zheng 
Publication date: 27 September 1992
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 3978381
- P, NP, and the Post correspondence problem
- scientific article; zbMATH DE number 7683979
- scientific article
- 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)
- Title not available (Why is that?)
- Inhomogeneities in the polynomial-time degrees: The degrees of super sparse sets
- Differences between resource bounded degree structures
- All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Is there a logic for polynomial time?
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)
