STOC 2017 Accepted Papers • Exponential separation between quantum communication complexity and classical information complexity Anurag Anshu, Dave Touchette, Penghui Yao, Nengkun Yu • Local max-cut in smoothed polyn - Communication complexity - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2017-02-22 10:15:46		STOC 2017 Accepted Papers • Exponential separation between quantum communication complexity and classical information complexity Anurag Anshu, Dave Touchette, Penghui Yao, Nengkun Yu • Local max-cut in smoothed polyn Add to Reading List Source URL: acm-stoc.org Download Document from Source Website File Size: 47,34 KB Share Document on Facebook