A syntactical analysis of non-size-increasing polynomial time computation

Details A syntactical analysis of non-size-increasing polynomial time computation A syntactical analysis of non-size-increasing polynomial time computation

2000-11-23

arxiv.org/abs/cs/0011037v2

ACM Transactions on Computational Logic 3(3), 383-401 (2002)

Computer Science

Logic in Computer Science

20 pages (latex), revised submission (expanded proofs, extended references, new section on tree iteration)

Scientific paper

A syntactical proof is given that all functions definable in a certain affine
linear typed lambda-calculus with iteration in all types are polynomial time
computable. The proof provides explicit polynomial bounds that can easily be
calculated.

Affiliated with

Also associated with

No associations

Rating

A syntactical analysis of non-size-increasing polynomial time computation 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 A syntactical analysis of non-size-increasing polynomial time computation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A syntactical analysis of non-size-increasing polynomial time computation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-729550