To the problem P=?NP

MaRDI QIDQ1380293zbMATHFDO

Authors J. Ning

Publication date 27 July 1998

Published in Doklady Mathematics (Search for Journal in Brave)

zbMATH Keywords

Turing machine

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• A short essay towards if P not equal NP
• A syntactical definition of the problem
• scientific article; zbMATH DE number 4066861
• Nondeterminism within $P^ * $
• scientific article; zbMATH DE number 176517

Cited in

(11)

• scientific article; zbMATH DE number 62443 (Why is no real title available?)
• scientific article; zbMATH DE number 5787962 (Why is no real title available?)
• P versus NP: the star problem of the mathematics of computation
• scientific article; zbMATH DE number 2012168 (Why is no real title available?)
• Why is the \(\mathrm{P}=?\mathrm{NP}\) question so difficult
• Concerning existential definition of the class \(NP\): Theoretical analysis of an alternative approach
• A short essay towards if P not equal NP
• A syntactical definition of the problem
• Compatibility matrix method
• \(\mathbf P =\mathbf{NP}\) for some structures over the binary words
• Decidability of NP-complete problems

This page was built for publication: To the problem P=?NP

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