Improved bounds for the randomized decision tree complexity of recursive majority (bibtex)
by F. Magniez, A. Nayak, M. Santha, J. Sherman, G. Tardos, D. Xiao
Reference:
Improved bounds for the randomized decision tree complexity of recursive majority (F. Magniez, A. Nayak, M. Santha, J. Sherman, G. Tardos, D. Xiao), In Random Structures & Algorithms, 2015. (To appear)
Bibtex Entry:
@article{mnsstx15,
	Author = {F. Magniez and A. Nayak and M. Santha and J. Sherman and G. Tardos and D. Xiao},
	Date-Added = {2016-01-31 10:25:47 +0000},
	Date-Modified = {2016-01-31 14:47:34 +0000},
	Journal = {Random Structures \& Algorithms},
	Note = {To appear},
	Title = {Improved bounds for the randomized decision tree complexity of recursive majority},
	Year = {2015},
	Bdsk-Url-1 = {./PAPIERS/mnsstx-rsa15.pdf}}
Powered by bibtexbrowser