# Seminars

### MINI-WORKSHOP ON PSEUDORANDOMNESS

### MINI-WORKSHOP ON PSEUDORANDOMNESS

### Computer Science/Discrete Mathematics Seminar I

The sensitivity conjecture is a major outstanding foundational problems about boolean functions is the sensitivity conjecture. In one of its many forms, it asserts that the degree of a boolean function (i.e. the minimum degree of a real polynomial...

### Computer Science/Discrete Mathematics Seminar II

Let $S$ and $T$ be two dense subsets of $G^n$, where $G$ is the special linear group $\mathrm{SL}(2,q)$ for a prime power $q$. If you sample uniformly a tuple $(s_1,\ldots,s_n)$ from $S$ and a tuple $(t_1,\ldots,t_n)$ from $T$ then their interleaved...

### Computer Science/Discrete Mathematics Seminar I

### Computer Science/Discrete Mathematics Seminar II

A square matrix $V$ is called rigid if every matrix obtained by altering a small number of entries of $V$ has sufficiently high rank. While random matrices are rigid with high probability, no explicit constructions of rigid matrices are known to...

### Computer Science/Discrete Mathematics Seminar I

During last fifty years a strong machine learning theory has been developed. This theory includes: 1. The necessary and sufficient conditions for consistency of learning processes. 2. The bounds on the rate of convergence which in general cannot be...