The Complexity of Goldbach's Conjecture and Riemann's Hypothesis

Calude, E.

dc.contributor.author	Calude, E.	en
dc.date.accessioned	2012-01-16T03:19:41Z	en
dc.date.available	2012-01-16T03:19:41Z	en
dc.date.issued	2009	en
dc.identifier.citation	CDMTCS Research Reports CDMTCS-370 (2009)	en
dc.identifier.issn	1178-3540	en
dc.identifier.uri	http://hdl.handle.net/2292/10523	en
dc.description.abstract	In this paper we obtain better upper bounds on the complexities of Goldbach’s Conjecture and Riemann’s Hypothesis in [3] and [8] by improving the register machine language used as well as the optimisation technique.	en
dc.publisher	Department of Computer Science, The University of Auckland, New Zealand	en
dc.relation.ispartofseries	CDMTCS Research Report Series	en
dc.rights.uri	https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm	en
dc.source.uri	http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/secondcgi.pl?serial	en
dc.title	The Complexity of Goldbach's Conjecture and Riemann's Hypothesis	en
dc.type	Technical Report	en
dc.subject.marsden	Fields of Research::280000 Information, Computing and Communication Sciences	en
dc.rights.holder	The author(s)	en
dc.rights.accessrights	http://purl.org/eprint/accessRights/OpenAccess	en