Previous Conferences & Workshops

A number of well known problems (Mackey analogy, Parthasarathy-Atiyah-Schmid construction of the discrete series, Novikov conjecture, stable Gromov-Lawson-Rosenberg conjecture, Kadison-Kaplansky conjecture) are contained in the issue of...

We study properties of random Bernoulli matrices. In particular, we determine the typical value of the determinant. We also obtain a new bound on the probability that the matrix is singular. Joint work with T. Tao.

We prove a number of general theorems about CZK, the class of problems possessing computational zero-knowledge proofs. Our results are *unconditional*, in contrast to most previous works on CZK which rely on the assumption that one-way functions...

We consider the complexity of properly learning concept classes, i.e. when the learner must output a hypothesis of the same form as the unknown concept. We present the following new upper and lower bounds on well-known concept classes: 1. We show...