We study depth-$4$ algebraic circuits with bounded top and bottom fan-in over fields of characteristic $0$. These circuits compute sums of at most $k$ products of polynomials of degree at most $\delta$. We denote this class of circuits by $\Sigma^{[k]}\Pi\Sigma\Pi^{[\delta]}$. Our hard polynomial for this class is $P_{k + 1,n}$, ... more >>>
Border complexity captures polynomials that can be approximated arbitrarily well by small algebraic circuits, and debordering asks how efficiently such an approximation can be converted into an exact computation. Debordering lies at the heart of the gap between Valiant's determinant versus permanent conjecture and its strengthening by Mulmuley and Sohoni ... more >>>
Randomness is a fundamental requirement in cryptographic systems, enabling secure encryption, commitments, and zero-knowledge proofs. However, real-world randomness sources often suffer from weaknesses that adversaries can exploit, leading to significant security vulnerabilities. While deterministic randomness extraction from a single min-entropy source is impossible, two-source extractors provide a robust solution by ... more >>>