Seminars Sorted by Series

Short Talks by Postdoctoral Members

Oct
04
2006

Short Talks by Postdoctoral Members

Circuit Lower Bounds and Incomplete Exponential Sums
3:15pm|S-101

In this talk I will consider depth-three circuits having a MAJORITY gate at the output, MODULO(m) gates in the middle, and polylog-degree AND gates at the inputs. It is conjectured that such circuits need exponential size to compute the MODULO(q)...

Oct
11
2006

Short Talks by Postdoctoral Members

The Indentity Testing Problem
4:00pm|S-101

Identity Testing is the following problem: given an arithmetic circuit C with coefficients from some field F, determine if the polynomial computed by the circuit is the identically zero polynomial or not. This problem admits a simple and efficient...