dc.contributor.author | Chen, Q | |
dc.contributor.author | Su, K | |
dc.contributor.author | Wu, L | |
dc.date.accessioned | 2017-05-03T12:27:44Z | |
dc.date.available | 2017-05-03T12:27:44Z | |
dc.date.issued | 2011 | |
dc.date.modified | 2013-06-26T02:55:58Z | |
dc.identifier.issn | 1553-9105 | |
dc.identifier.uri | http://hdl.handle.net/10072/44872 | |
dc.description.abstract | In mathematics, various representations of real numbers have been investigated and all these representations are proved to be mathematically equivalent. Furthermore, it is known that all effective versions of these representations lead to the same class of "computable real numbers". However, when subrecursive (such as primitive recursive) is taken into account, these representations can lead to different notions of "computable real numbers". This paper will look into the polynomial-time version of the problem for computable real numbers under different representations. We will summarize the known results to exhibit the comprehensive hierarchy they form. Our goal is to clarify systematically how the polynomial-time computability depends on the representations of the real numbers. | |
dc.description.peerreviewed | Yes | |
dc.description.publicationstatus | Yes | |
dc.format.extent | 459649 bytes | |
dc.format.mimetype | application/pdf | |
dc.language | English | |
dc.language.iso | eng | |
dc.publisher | Binary Information Press | |
dc.publisher.place | United States | |
dc.publisher.uri | http://jof-cis.com/all-volume-issues/ | |
dc.relation.ispartofstudentpublication | N | |
dc.relation.ispartofpagefrom | 1108 | |
dc.relation.ispartofpageto | 1115 | |
dc.relation.ispartofissue | 4 | |
dc.relation.ispartofjournal | Journal of Computational Information Systems | |
dc.relation.ispartofvolume | 7 | |
dc.rights.retention | Y | |
dc.subject.fieldofresearch | Numerical and computational mathematics not elsewhere classified | |
dc.subject.fieldofresearch | Information and computing sciences | |
dc.subject.fieldofresearchcode | 490399 | |
dc.subject.fieldofresearchcode | 46 | |
dc.title | Polynomial-time hierarchy of computable reals | |
dc.type | Journal article | |
dc.type.description | C1 - Articles | |
dc.type.code | C - Journal Articles | |
gro.rights.copyright | © 2011 Binary Information Press. The attached file is reproduced here in accordance with the copyright policy of the publisher. Please refer to the journal's website for access to the definitive, published version. | |
gro.date.issued | 2011 | |
gro.hasfulltext | Full Text | |
gro.griffith.author | Su, Kaile | |