Abstract
Improving the exponential bound of [5], we show that the largest possible gap between the deterministic communication complexity and the public-coin zero-error randomized communication complexity is at most polynomial. Previously, such a bound was known only in the private-coin model. The proof combines the approach of Gavinsky and Lovett [4] with new ideas.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
