Lics

IEEE Symposium on Logic in Computer Science

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

Thirtieth Annual IEEE Symposium on

Logic in Computer Science (LICS 2015)

Paper: On the Complexity of Linear Arithmetic with Divisibility (at LICS 2015)

Authors: Antonia Lechner Joël Ouaknine James Worrell

Abstract

No Abstract Available

BibTeX

  @InProceedings{LechnerOuaknineWorr-OntheComplexityofLi,
    author = 	 {Antonia Lechner and Joël Ouaknine and James Worrell},
    title = 	 {On the Complexity of Linear Arithmetic with Divisibility},
    booktitle =  {Proceedings of the Thirtieth Annual IEEE Symposium on Logic in Computer Science (LICS 2015)},
    year =	 {2015},
    month =	 {July}, 
    pages =      {667--676},
    location =   {Kyoto, Japan}, 
    publisher =	 {IEEE Computer Society Press}
  }
   

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