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. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Santhanam, R. (2010). The complexity of explicit constructions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6158 LNCS, pp. 372–375). https://doi.org/10.1007/978-3-642-13962-8_41
Mendeley helps you to discover research relevant for your work.