To the problem P=?NP

zbMATH Open0892.68057MaRDI QIDQ1380293FDOQ1380293

Authors: J. Ning 

Publication date: 27 July 1998

Published in: Doklady Mathematics (Search for Journal in Brave)

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 Keywords

Turing machine

Mathematics Subject Classification ID

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

Cited In (8)

• Title not available (Why is that?)
• Title not available (Why is that?)
• P versus NP: the star problem of the mathematics of computation
• Why is the \(\mathrm{P}=?\mathrm{NP}\) question so difficult
• \(\mathbf P =\mathbf{NP}\) for some structures over the binary words
• A syntactical definition of the problem
• Concerning existential definition of the class \(NP\): Theoretical analysis of an alternative approach
• Title not available (Why is that?)

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)