Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma

Details Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma

2010-07-18

arxiv.org/abs/1007.2989v3

In LICS 2011, 26th Annual IEEE Symposium on Logic in Computer Science, pages 269--278. IEEE Press

Computer Science

Logic in Computer Science

Scientific paper

10.1109/LICS.2011.39

Dickson's Lemma is a simple yet powerful tool widely used in termination proofs, especially when dealing with counters or related data structures. However, most computer scientists do not know how to derive complexity upper bounds from such termination proofs, and the existing literature is not very helpful in these matters. We propose a new analysis of the length of bad sequences over (N^k,\leq) and explain how one may derive complexity upper bounds from termination proofs. Our upper bounds improve earlier results and are essentially tight.

Affiliated with

Also associated with

No associations

Rating

Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma 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 Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-523161