The complexity of Euler's integer partition theorem

DOI10.1016/j.tcs.2012.03.023zbMath1283.68172OpenAlexW2137852471WikidataQ57001519 ScholiaQ57001519MaRDI QIDQ714811

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

Publication date: 11 October 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.03.023

zbMATH Keywords

complexity of mathematical problemsEuler's integer partition theorem

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Elementary theory of partitions (11P81)

Related Items

Inductive Complexity of P versus NP Problem ⋮ INDUCTIVE COMPLEXITY MEASURES FOR MATHEMATICAL PROBLEMS

Cites Work

• Occam's razor
• Are these the most beautiful?
• A Program-Size Complexity Measure for Mathematical Problems and Conjectures
• The complexity of the four colour theorem
• Fast algorithms for genegrating integer partitions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item