Previous Conferences & Workshops

Nov
27
2007

Arithmetic Combinatorics

Inverse Theorems for Large Subsets of sums of Dissociated Sets
2:00pm|West Building Lecture Theatre

Let $G$ be a finite Abelian group, say $Z/NZ$. A set $\Lambda = \{ lambda_1, \dots, \lambda_{m} \}$ is called {\it dissociated} if any equality $\sum_{i=1}^m \varepsilon_i \lambda_i = 0$, where $\varepsilon_i \in \{ 0,\pm 1 \}$ implies that all $...

Nov
27
2007

Computer Science/Discrete Mathematics Seminar II

The Approximation Complexity of Win-Lose Games
10:30am|West Building Lecture Theatre

The computation of Nash equilibria has been a problem that spanned half a century that has attracted Economists, Operations Researchers, and most Recently, Computer Scientists. Intuitively, the complexity of a game grows along a few axes: the number...

Nov
26
2007

Computer Science/Discrete Mathematics Seminar I

On Hardness of Learning Intersection of Two Halfspaces
11:15am|West Building Lecture Theatre

I will present a result that shows hardness of weak PAC-learning intersection of two halfspaces using a hypothesis which is an intersection of k halfspaces for any (fixed) integer k. Specifically, for every integer k and an arbitrarily small...