A Path Order for Rewrite Systems that Compute Exponential Time Functions (Technical Report)

Details A Path Order for Rewrite Systems that Compute Exponential Time Functions (Technical Report) A Path Order for Rewrite Systems that Compute Exponential Time Functions (Technical Report)

2010-10-06

arxiv.org/abs/1010.1128v3

Computer Science

Computational Complexity

Technical Report

Scientific paper

In this paper we present a new path order for rewrite systems, the exponential path order EPOSTAR. Suppose a term rewrite system is compatible with EPOSTAR, then the runtime complexity of this rewrite system is bounded from above by an exponential function. Furthermore, the class of function computed by a rewrite system compatible with EPOSTAR equals the class of functions computable in exponential time on a Turing maschine.

Affiliated with

Also associated with

No associations

Rating

A Path Order for Rewrite Systems that Compute Exponential Time Functions (Technical Report) 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 Path Order for Rewrite Systems that Compute Exponential Time Functions (Technical Report), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Path Order for Rewrite Systems that Compute Exponential Time Functions (Technical Report) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-427628