Lics

IEEE Symposium on Logic in Computer Science

LICS Home - LICS Awards - LICS Newsletters - LICS Archive - LICS Organization - Logic-Related Conferences - Links

Twenty-Sixth Annual IEEE Symposium on

Logic in Computer Science (LICS 2011)

Paper: Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma (at LICS 2011)

Authors: Diego Figueira Santiago Figueira Sylvain Schmitz Philippe Schnoebelen

Abstract

No Abstract Available

BibTeX

  @InProceedings{FigueiraFigueiraSch-AckermannianandPrim,
    author = 	 {Diego Figueira and Santiago Figueira and Sylvain Schmitz and Philippe Schnoebelen},
    title = 	 {Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma},
    booktitle =  {Proceedings of the Twenty-Sixth Annual IEEE Symposium on Logic in Computer Science (LICS 2011)},
    year =	 {2011},
    month =	 {June}, 
    pages =      {269--278},
    location =   {Toronto, Canada}, 
    publisher =	 {IEEE Computer Society Press}
  }
   

Last modified: 2018-06-2121:59
Andrzej Murawski