Sensitivity Versus Certificate Complexity of Boolean Functions

Andris Ambainis, Krisjanis Prusis, Jevgenijs Vihrovs. Sensitivity Versus Certificate Complexity of Boolean Functions. In Alexander S. Kulikov, Gerhard J. Woeginger, editors, Computer Science - Theory and Applications - 11th International Computer Science Symposium in Russia, CSR 2016, St. Petersburg, Russia, June 9-13, 2016, Proceedings. Volume 9691 of Lecture Notes in Computer Science, pages 16-28, Springer, 2016. [doi]

@inproceedings{AmbainisPV16,
  title = {Sensitivity Versus Certificate Complexity of Boolean Functions},
  author = {Andris Ambainis and Krisjanis Prusis and Jevgenijs Vihrovs},
  year = {2016},
  doi = {10.1007/978-3-319-34171-2_2},
  url = {http://dx.doi.org/10.1007/978-3-319-34171-2_2},
  researchr = {https://researchr.org/publication/AmbainisPV16},
  cites = {0},
  citedby = {0},
  pages = {16-28},
  booktitle = {Computer Science - Theory and Applications - 11th International Computer Science Symposium in Russia, CSR 2016, St. Petersburg, Russia, June 9-13, 2016, Proceedings},
  editor = {Alexander S. Kulikov and Gerhard J. Woeginger},
  volume = {9691},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-34170-5},
}