Submissions claiming to resolve a grand challenge, such as the P vs. NP problem, may be rejected without further consideration.
Submissions containing an essential part that seems to be generated by AI tools and/or are written in a way that humans will find hard to understand, may be rejected regardless of their merits. ECCC is intended for communication among humans.
For more details see the Call for Papers.In the last few days, a Denial of Service attack was launched on universities in Israel, leading the administrators of the Israel Academic network to block access to it from the global internet. Consequently, websites such as ECCC have been accessible only from within the Israeli and European academic networks.
It seems that this blocking was just removed, and we hope it will not be put back in the future.
Needless to say, deciding on such blocking is not in our control, but we do apologize for this disruption of service.
A boolean function $f$ has Fourier dimension $k$ if its strings with nonzero Fourier coefficients span a subspace of dimension $k$. We first consider the property testing task of determining whether a function has Fourier dimension at most $k$, or is $\epsilon$-far from being so. We show that there is ... more >>>
We give fast algorithms for low-rank tensor decomposition.
Over $\mathbb R$ and $\mathbb C$ we give a deterministic algorithm that takes as input an order-$d$, width-$n$, rank-$k$ tensor, gets measurement access to the tensor, runs in time
$k^{O(k^2)}\cdot \mathrm{poly}(n,d)$, and finds a minimal decomposition as a sum of rank-one ...
more >>>
The problem of decomposing an algebraic variety into more structured components (such as equidimensional, irreducible, or connected components) is a fundamental problem in computer algebra and algebraic geometry. In this work, we study the computational complexity of computing equidimensional components of algebraic varieties, represented via Chow forms.
We improve the ... more >>>
