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)

Invited Paper: The Complexity of Evaluating First-Order Sentences over a Fixed Structure (at LICS 2011)

Authors: Andrei A. Krokhin

Abstract

No Abstract Available

BibTeX

  @InProceedings{Krokhin-TheComplexityofEval,
    author = 	 {Andrei A. Krokhin},
    title = 	 {The Complexity of Evaluating First-Order Sentences over a Fixed Structure},
    booktitle =  {Proceedings of the Twenty-Sixth Annual IEEE Symposium on Logic in Computer Science (LICS 2011)},
    year =	 {2011},
    month =	 {June}, 
    pages =      {331},
    location =   {Toronto, Canada}, 
    note =       {Invited Talk},
    publisher =	 {IEEE Computer Society Press}
  }
   

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