Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



LATEST > REPORTS:
RSS-Feedprevious PreviousNext next

TR26-215 | 25th September 2026
Geoffroy Couteau, Nikolas Melissaris, Tamara Paris

Interactive Proofs of Proximity for Model Evaluation

We study interactive proofs of proximity (IPP) for model evaluation: a resource-limited verifier interacts with an untrusted prover, typically the model owner, to certify statistical properties of a model under an unknown input distribution. Our formulation is shaped by the constraints of practical evaluation: it separates sampling the input distribution ... more >>>


TR26-214 | 26th September 2026
Gil Cohen, Dean Doron, Noam Goldgraber

Algebraic-Geometric Parvaresh--Vardy Subspace Designs and Rank Condensers

A subspace design is a collection of subspaces $H_1,\ldots,H_n$ of $\mathbb{F}_q^k$ with the property that no low-dimensional subspace $W$ intersects the collection ``too much’’. Subspace designs and related objects in linear-algebraic pseudorandomness have found a broad range of applications, ranging from list decoding and recovery, to derandomizing algorithms.

We ... more >>>


TR26-213 | 26th September 2026
Amos Beimel, Oded Nir

The Power of Multislices in Monotone Computation

Motivated by recent constructions and barriers in secret sharing, we study multislice functions. These functions, parametrized by a width parameter $w$, take the value 0 on inputs of Hamming weight below a base value $k$, 1 on inputs of weight above $k+w$, and are monotone in between.
We first investigate ... more >>>



previous PreviousNext next


ISSN 1433-8092 | Imprint