Title	Lookup functions for separating randomized communication, quantum communication and approximate log-rank
Creator	Garg, Ankit
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2017-03-22T11:20
Description	I will talk about two recent works, one by [Anshu, Belovs, Ben-David, Goos, Jain, Kothari, Lee, Santha] and another by [Anshu, Ben-David, G., Jain, Kothari, Lee] which use “lookup functions” to get various separations in communication complexity.
Extent	32 minutes
Subject	Mathematics; Computer science; Information and communication, circuits; Theoretical computer science
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: Microsoft Research New England
Series	BIRS Workshop Lecture Videos (Banff, Alta)
Date Available	2017-09-19
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0355682
URI	http://hdl.handle.net/2429/63064
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Postdoctoral
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos