On Polynomial Time Computable Numbers
| dc.creator | Matsui, Tetsushi | |
| dc.date | 2006-08-16 | |
| dc.date.accessioned | 2026-07-07T07:20:00Z | |
| dc.date.available | 2026-07-07T07:20:00Z | |
| dc.description | It will be shown that the polynomial time computable numbers form a field, and especially an algebraically closed field. | |
| dc.description | 19 pages | |
| dc.identifier | https://arxiv.org/abs/cs/0608067 | |
| dc.identifier | http://arxiv.org/abs/cs/0608067 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/114837 | |
| dc.subject | Computational Complexity | |
| dc.title | On Polynomial Time Computable Numbers | |
| dc.type | text |