Separations in query complexity based on pointer functions. (bibtex)
by Andris Ambainis, Kaspars Balodis, Aleksandrs Belovs, Troy Lee, Miklos Santha, Juris Smotrovs
Reference:
Separations in query complexity based on pointer functions. (Andris Ambainis, Kaspars Balodis, Aleksandrs Belovs, Troy Lee, Miklos Santha, Juris Smotrovs), In Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016, ACM, 2016.
Bibtex Entry:
@proceedings{conf/stoc/2016,
	Booktitle = {Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016},
	Date-Added = {2019-02-24 13:05:01 +0100},
	Date-Modified = {2019-02-24 13:05:01 +0100},
	Publisher = {ACM},
	Year = {2016}}
@inproceedings{conf/stoc/AmbainisBBLSS16,
	Author = {Andris Ambainis and Kaspars Balodis and Aleksandrs Belovs and Troy Lee and Miklos Santha and Juris Smotrovs},
	Crossref = {conf/stoc/2016},
	Date-Added = {2019-02-24 13:05:01 +0100},
	Date-Modified = {2019-02-24 15:27:15 +0100},
	Keywords = {c-acti,irif,Santha,eq-ac,selected},
	Pages = {800-813},
	Title = {Separations in query complexity based on pointer functions.},
	Year = {2016},
	Bdsk-Url-1 = {http://doi.acm.org/10.1145/2897518.2897524}}
Powered by bibtexbrowser