Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX record conf/mfcs/AmbainisP14
@inproceedings{DBLP:conf/mfcs/AmbainisP14, author = {Andris Ambainis and Krisjanis Prusis}, editor = {Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and Martin Dietzfelbinger and Zolt{\'{a}}n {\'{E}}sik}, title = {A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity}, booktitle = {Mathematical Foundations of Computer Science 2014 - 39th International Symposium, {MFCS} 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {8635}, pages = {33--44}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-662-44465-8\_4}, doi = {10.1007/978-3-662-44465-8\_4}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/AmbainisP14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.