Inductive complexity of P versus NP problem (extended abstract)

DOI10.1007/978-3-642-32894-7_2MaRDI QIDQ4648186zbMATH OpenOpenAlexWikidataFDO

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

Publication date 8 November 2012

Published in Unconventional Computation and Natural Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32894-7_2

Mathematics Subject Classification ID

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

Recommendations

• Inductive complexity of the P versus NP problem
• Inductive complexity measures for mathematical problems
• The complexity of Riemann's hypothesis
• scientific article; zbMATH DE number 5234254
• \({\mathcal P}\), \({\mathcal{NP}}\) and mathematics -- a computational complexity perspective

Cites work

• 2015 Mathematics Programs That Make a Difference
• A program-size complexity measure for mathematical problems and conjectures
• A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms
• Computing Partitions with Applications to the Knapsack Problem
• Evaluating the complexity of mathematical problems. I
• scientific article; zbMATH DE number 5772857 (Why is no real title available?)
• scientific article; zbMATH DE number 5787962 (Why is no real title available?)
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 1911266 (Why is no real title available?)
• scientific article; zbMATH DE number 5234254 (Why is no real title available?)
• Super-Recursive Algorithms
• The complexity of Euler's integer partition theorem
• The complexity of proving chaoticity and the Church-Turing thesis
• The complexity of Riemann's hypothesis
• The complexity of the four colour theorem
• The complexity of theorem-proving procedures
• The nature of computation

Cited in

(7)

• An almost machine-independent theory of program-length complexity, sophistication, and induction
• Inductive complexity measures for mathematical problems
• Inductive Complexity of Goodstein’s Theorem
• scientific article; zbMATH DE number 1834636 (Why is no real title available?)
• The complexity of Riemann's hypothesis
• Inductive complexity of the P versus NP problem
• On the quantifier complexity of \(\Delta_{n+1}(T)\)-induction

This page was built for publication: Inductive complexity of P versus NP problem (extended abstract)

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