Provability and consistency of circuit lower bounds
Moritz Müller ( Universitat Politècnica de Catalunya )
- 14:00 14th May 2019 ( week 3, Trinity Term 2019 )Room 441, Wolfson Building
In 1995 Razborov asked for the right fragment of bounded arithmetic capturing existing techniques to prove circuit lower bounds for explicit Boolean functions. The talk reports some new developments.
Share this:
