Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



LATEST > REPORTS:
RSS-FeedNext next

TR26-012 | 3rd February 2026
Johan Håstad

Perfectly Satisfiable Systems of Linear Equations and Fixed Weight Solutions

We study systems of linear equations modulo two in $n$ variables
with three variables in each equation. We assume that the system has
a solution with $pn$ variables taking the value 1 for some value
$00$ it is hard to find a solution
of the same weight that satisfies at ... more >>>


TR26-011 | 15th January 2026
Divesh Aggarwal, Zihan Li, Saswata Mukherjee, Maciej Obremski, João Ribeiro

Complete Characterization of Randomness Extraction from DAG-Correlated Sources

We introduce the SHEDAG (Somewhere Honest Entropic sources over Directed Acyclic Graphs) source model, a general model for multi-block randomness sources with causal correlations.
A SHEDAG source is defined over a directed acyclic graph (DAG) $G$ whose nodes output $n$-bit blocks. Blocks output by honest nodes are independent (by ... more >>>


TR26-010 | 1st February 2026
Sourav Chakraborty, Anna Gal

Nearly Tight Bounds on the Block Number of Boolean Functions in Terms of Sensitivity

This paper explores the previously studied measure called block number of Boolean functions, that counts the maximum possible number of minimal sensitive blocks for any input. We present close to tight upper bounds on the block number in terms of the function’s sensitivity and the allowed block size, improving previous ... more >>>



Next next


ISSN 1433-8092 | Imprint