Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > WRONSKIANS:
Reports tagged with Wronskians:
TR14-162 | 28th November 2014
Michael Forbes, Venkatesan Guruswami

Dimension Expanders via Rank Condensers

An emerging theory of "linear-algebraic pseudorandomness" aims to understand the linear-algebraic analogs of fundamental Boolean pseudorandom objects where the rank of subspaces plays the role of the size of subsets. In this work, we study and highlight the interrelationships between several such algebraic objects such as subspace designs, dimension ... more >>>


TR26-217 | 28th September 2026
Shubham Bhardwaj, Ramprasad Saptharishi

Hitting Sets for Polynomials with Small Partial Derivative Spaces

Revisions: 1

We give an explicit hitting set of size $\text{poly}(n,d,r)$ for the class of $n$-variate degree-$d$ polynomials whose partial derivative space is bounded by $r$, over any field $\mathbb{F}$ of characteristic zero. In particular, this yields a polynomial sized hitting set for the class of depth-$3$ powering circuits.

The main ... more >>>




ISSN 1433-8092 | Imprint