The complexity of Euler's integer partition theorem
From MaRDI portal
Publication:714811
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
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