Boolean Functions with a Low Polynomial Degree and Quantum Query Algorithms

Raitis Ozols, Rusins Freivalds, Jevgenijs Ivanovs, Elina Kalnina, Lelde Lace, Masahiro Miyakawa, Hisayuki Tatsumi, Daina Taimina. Boolean Functions with a Low Polynomial Degree and Quantum Query Algorithms. In Peter Vojtás, Mária Bieliková, Bernadette Charron-Bost, Ondrej Sýkora, editors, SOFSEM 2005: Theory and Practice of Computer Science, 31st Conference on Current Trends in Theory and Practice of Computer Science, Liptovský Ján, Slovakia, January 22-28, 2005, Proceedings. Volume 3381 of Lecture Notes in Computer Science, pages 408-412, Springer, 2005. [doi]

@inproceedings{OzolsFIKLMTT05,
  title = {Boolean Functions with a Low Polynomial Degree and Quantum Query Algorithms},
  author = {Raitis Ozols and Rusins Freivalds and Jevgenijs Ivanovs and Elina Kalnina and Lelde Lace and Masahiro Miyakawa and Hisayuki Tatsumi and Daina Taimina},
  year = {2005},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3381&spage=408},
  researchr = {https://researchr.org/publication/OzolsFIKLMTT05},
  cites = {0},
  citedby = {0},
  pages = {408-412},
  booktitle = {SOFSEM 2005: Theory and Practice of Computer Science, 31st Conference on Current Trends in Theory and Practice of Computer Science, Liptovský Ján, Slovakia, January 22-28, 2005, Proceedings},
  editor = {Peter Vojtás and Mária Bieliková and Bernadette Charron-Bost and Ondrej Sýkora},
  volume = {3381},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-24302-X},
}