scientific article

zbMATH Open0792.68066MaRDI QIDQ4010140

Xizhong Zheng

Publication date: 27 September 1992

Title of this publication is not available (Why is that?)

zbMATH Keywords

P=?NPpositive and negative degrees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (6)

Is there a logic for polynomial time? ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size

Recommendations

• Honest polynomial time reducibilities and the \(P=?NP\) problem 👍 👎
• Honest polynomial degrees and \(P=?NP\) 👍 👎
• To the problem P=?NP 👍 👎
• P, NP, and the Post correspondence problem 👍 👎
• 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?) 👍 👎

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)