8 citations · 25 across the 21 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2021
Sketching with Kerdock's crayons: Fast sparsifying transforms for arbitrary linear maps
Tim Fuchs, David Gross, Felix Krahmer +2
Given an arbitrary matrix , we consider the fundamental problem of computing for any such that is -sparse. While fast al…
cs.CC2018
Fair redistricting is hard
Richard Kueng, Dustin G. Mixon, Soledad Villar
Gerrymandering is a long-standing issue within the U.S. political system, and it has received scrutiny recently by the U.S. Supreme Court. In this note, we prove that deciding whet…