Inductive complexity of the P versus NP problem

DOI10.1142/S0129626413500072MaRDI QIDQ5408361zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Elena Calude, Melissa S. Queen, Cristian S. Calude

Publication date 10 April 2014

Published in Parallel Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129626413500072

zbMATH Keywords

inductive complexityinductive computationP vs. NP problem

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Inductive complexity of P versus NP problem (extended abstract)
• Inductive complexity measures for mathematical problems
• \({\mathcal P}\), \({\mathcal{NP}}\) and mathematics -- a computational complexity perspective
• scientific article; zbMATH DE number 5234254
• scientific article; zbMATH DE number 5772857

Cites work

• Computing Partitions with Applications to the Knapsack Problem
• In some curved spaces, one can solve NP-hard problems in polynomial time
• The complexity of the four colour theorem

Cited in

(3)

• Inductive complexity measures for mathematical problems
• Inductive complexity of P versus NP problem (extended abstract)
• Inductive Complexity of Goodstein’s Theorem

This page was built for publication: Inductive complexity of the P versus NP problem

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