On Polynomial Time Computable Numbers

Details On Polynomial Time Computable Numbers On Polynomial Time Computable Numbers

2006-08-16

arxiv.org/abs/cs/0608067v1

Computer Science

Computational Complexity

19 pages

Scientific paper

It will be shown that the polynomial time computable numbers form a field,
and especially an algebraically closed field.

Affiliated with

Also associated with

No associations

Rating

On Polynomial Time Computable Numbers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Polynomial Time Computable Numbers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Polynomial Time Computable Numbers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-219932