Inductive Complexity of P versus NP Problem
From MaRDI portal
Publication:4648186
DOI10.1007/978-3-642-32894-7_2zbMath1375.68064OpenAlexW166247508WikidataQ57001497 ScholiaQ57001497MaRDI QIDQ4648186
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
Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cites Work
- The complexity of Euler's integer partition theorem
- A Program-Size Complexity Measure for Mathematical Problems and Conjectures
- The complexity of the four colour theorem
- Super-Recursive Algorithms
- 2015 Mathematics Programs That Make a Difference
- Computing Partitions with Applications to the Knapsack Problem
- A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms
- The complexity of proving chaoticity and the Church–Turing thesis
- The complexity of theorem-proving procedures
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item