Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > GROUP-THEORETIC ALGORITHMS:
Reports tagged with Group-Theoretic Algorithms:
TR25-157 | 8th September 2025
Tejas Nareddy, Abhishek Mishra

Recovery Reductions, Conjectures, and Barriers

We introduce and initiate the study of a new model of reductions called the random noise model. In this model, the truth table $T_f$ of the function $f$ is corrupted on a randomly chosen $\delta$-fraction of instances. A randomized algorithm $\mathcal{A}$ is a $\left(t, \delta, 1-\varepsilon\right)$-recovery reduction for $f$ if:

... more >>>

TR26-177 | 7th September 2026
Joshua Grochow, Pranjal Srivastava, Dhara Thakkar

Algorithms for Finite Group Epimorphism Testing

The Group Epimorphism Problem (GpEpi) asks, given two finite groups $G_1$ and $G_2$, whether there exists a surjective group homomorphism, or epimorphism, from $G_1$ to $G_2$. When the input groups are given by their multiplication (Cayley) tables, the problem admits a quasipolynomial-time algorithm in general, but little is known about ... more >>>




ISSN 1433-8092 | Imprint