Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma

@article{Figueira2011AckermannianAP,
  title={Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma},
  author={Diego Figueira and Santiago Figueira and Sylvain Schmitz and Philippe Schnoebelen},
  journal={2011 IEEE 26th Annual Symposium on Logic in Computer Science},
  year={2011},
  pages={269-278}
}
Dickson's Lemma is a simple yet powerful tool widely used in decidability proofs, especially when dealing with counters or related data structures in algorithmics, verification and model-checking, constraint solving, logic, etc. While Dickson's Lemma is well-known, most computer scientists are not aware of the complexity upper bounds that are entailed by its use. This is mainly because, on this issue, the existing literature is not very accessible. We propose a new analysis of the length of bad… CONTINUE READING

Citations

Publications citing this paper.

FILTER CITATIONS BY YEAR

2010
2019

CITATION STATISTICS

  • 13 Highly Influenced Citations

  • Averaged 8 Citations per year over the last 3 years

Similar Papers

Loading similar papers…