A New Order-theoretic Characterisation of the Polytime Computable Functions

Details A New Order-theoretic Characterisation of the Polytime Computable Functions A New Order-theoretic Characterisation of the Polytime Computable Functions

2012-01-12

arxiv.org/abs/1201.2553v2

Computer Science

Computational Complexity

Technical Report

Scientific paper

We propose a new order, the small polynomial path order (sPOP* for short). The order sPOP* provides a characterisation of the class of polynomial time computable function via term rewrite systems. Any polynomial time computable function gives rise to a rewrite system that is compatible with sPOP*. On the other hand any function defined by a rewrite system compatible with sPOP* is polynomial time computable. Technically sPOP* is a tamed recursive path order with product status. Its distinctive feature is the precise control provided. For any rewrite system that is compatible with sPOP* that makes use of recursion up to depth d, the (innermost) runtime complexity is bounded from above by a polynomial of degree d.

Affiliated with

Also associated with

No associations

Rating

A New Order-theoretic Characterisation of the Polytime Computable Functions 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 New Order-theoretic Characterisation of the Polytime Computable Functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A New Order-theoretic Characterisation of the Polytime Computable Functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-152166