Lics

ACM/IEEE Symposium on Logic in Computer Science

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

Twenty-Eighth Annual IEEE Symposium on

Logic in Computer Science (LICS 2013)

Paper: On the Query Complexity of Real Functionals (at LICS 2013)

Authors: Hugo Férée Mathieu Hoyrup Walid Gomaa

Abstract

No Abstract Available

BibTeX

  @InProceedings{FreHoyrupGomaa-OntheQueryComplexit,
    author = 	 {Hugo Férée and Mathieu Hoyrup and Walid Gomaa},
    title = 	 {On the Query Complexity of Real Functionals},
    booktitle =  {Proceedings of the Twenty-Eighth Annual IEEE Symposium on Logic in Computer Science (LICS 2013)},
    year =	 {2013},
    month =	 {June}, 
    pages =      {103--112},
    location =   {New Orleans, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }
   

Last modified: 2022-10-3113:49
Sam Staton