The Complexity of Explicit Constructions

Rahul Santhanam

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The existence of extremal combinatorial objects, such as Ramsey graphs and expanders, is often shown using the probabilistic method. It is folklore that pseudo-random generators can be used to obtain explicit constructions of these objects, if the test that the object is extremal can be implemented in polynomial time. In this talk, we pose several questions geared towards initiating a structural approach to the relationship between extremal combinatorics and computational complexity. One motivation for such an approach is to understand better why circuit lower bounds are hard. Another is to formalize connections between the two areas, so that progress in one leads automatically to progress in the other.

Original languageEnglish
Title of host publicationPROGRAMS, PROOFS, PROCESSES
EditorsF Ferreira, B Lowe, E Mayordomo, LM Gomes
Place of PublicationBERLIN
PublisherSpringer-Verlag GmbH
Pages372-375
Number of pages4
ISBN (Print)978-3-642-13961-1
Publication statusPublished - 2010
Event6th Conference on Computability in Europe (CiE 2010) - Ponta Delgada
Duration: 30 Jun 20104 Jul 2010

Conference

Conference6th Conference on Computability in Europe (CiE 2010)
CityPonta Delgada
Period30/06/104/07/10

Cite this