License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2019.4
URN: urn:nbn:de:0030-drops-115664
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2019/11566/
Go to the corresponding LIPIcs Volume Portal

Pitassi, Toniann

Progress in Lifting and Applications in Lower Bounds (Invited Talk)

pdf-format:
LIPIcs-FSTTCS-2019-4.pdf (0.2 MB)

Abstract

Ever since Yao introduced the communication complexity model in 1979, it has played a pivotal role in our understanding of limitations for a wide variety of problems in Computer Science. In this talk, I will present the lifting method, whereby communication lower bounds are obtained by lifting much simpler lower bounds. I will show how lifting theorems have been used to solve many open problems in a variety of areas of computer science, including: circuit complexity, proof complexity, combinatorial optimization (size of linear programming formulations), cryptography (linear secret sharing schemes), game theory and privacy.
At the end of the talk, I will sketch the proof of a unified lifting theorem for deterministic and randomized communication (joint with Arkadev Chattopadyhay, Yuval Filmus, Sajin Koroth, and Or Meir.)

BibTeX - Entry

@InProceedings{pitassi:LIPIcs:2019:11566,
  author =	{Toniann Pitassi},
  title =	{{Progress in Lifting and Applications in Lower Bounds (Invited Talk)}},
  booktitle =	{39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
  pages =	{4:1--4:1},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-131-3},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{150},
  editor =	{Arkadev Chattopadhyay and Paul Gastin},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2019/11566},
  URN =		{urn:nbn:de:0030-drops-115664},
  doi =		{10.4230/LIPIcs.FSTTCS.2019.4},
  annote =	{Keywords: complexity theory, lower bounds, communication complexity}
}

Keywords: complexity theory, lower bounds, communication complexity
Collection: 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)
Issue Date: 2019
Date of publication: 04.12.2019

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI