The complexity of Euler's integer partition theorem
type: Item
instance of: scholarly article
title: The complexity of Euler's integer partition theorem
zbMATH Open document ID: 1283.68172
author: Cristian S. Calude
author: Elena Calude
author: Melissa S. Queen
published in: Theoretical Computer Science
publication date: 2012-10-11T00:00:00Z
Mathematics Subject Classification ID: 68Q30
Mathematics Subject Classification ID: 11P81
Mathematics Subject Classification ID: 68R05
zbMATH DE Number: 6093031
zbMATH Keywords: complexity of mathematical problems
zbMATH Keywords: Euler's integer partition theorem
Wikidata QID: Q57001519
MaRDI profile type: Publication
full work available at URL: j.tcs.2012.03.023
OpenAlex ID: W2137852471
cites work: Q3156941
cites work: Occam's razor
cites work: Q4806962
cites work: Q5439769
cites work: Q5188206
cites work: Q3584055
cites work: The complexity of the four colour theorem
cites work: Q5389345
cites work: A Program-Size Complexity Measure for Mathematical Problems and Conjectures
cites work: Q3726126
cites work: Fast algorithms for genegrating integer partitions
cites work: Are these the most beautiful?
DBLP publication ID: journals/tcs/CaludeCQ12
DOI: 10.1016/J.TCS.2012.03.023
description: scientific article; zbMATH DE number 6093031