25 citations · 80 across the 30 of their papers we have counts for
1 paper · 2 filters
Aris Filos-Ratsikas, Paul W. Goldberg
We show that the computational problem CONSENSUS-HALVING is PPA-complete, the first PPA-completeness result for a problem whose definition does not involve an explicit circuit. We…