A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Algebra in Computational Complexity (Dagstuhl Seminar 14391)
2015
Dagstuhl Reports
At its core, much of Computational Complexity is concerned with combinatorial objects and structures. But it has often proven true that the best way to prove things about these combinatorial objects is by establishing a connection to a more well-behaved algebraic setting. Indeed, many of the deepest and most powerful results in Computational Complexity rely on algebraic proof techniques. The Razborov-Smolensky polynomial-approximation method for proving constantdepth circuit lower bounds, the
doi:10.4230/dagrep.4.9.85
dblp:journals/dagstuhl-reports/AgrawalKTU14
fatcat:iailudx2rrhaxenbi3d7ou73ly