Showing cs.DSShow all
4 papers · 1 filter
cs.DS2026
An algorithm for -set cover
Josh Alman, Baitian Li, Kevin Pratt
We show that set cover on a universe of size and with sets of size at most can be solved in time . This improves on a -time alg…
cs.DS2025
Kronecker Powers, Orthogonal Vectors, and the Asymptotic Spectrum
Josh Alman, Baitian Li
We study circuits for computing depth-2 linear transforms defined by Kronecker power matrices. Recent works have improved on decades-old constructions in this area using a new ''re…
cs.DS2025
Faster Convolutions: Yates and Strassen Revisited
Cornelius Brand, Radu Curticapean, Baitian Li +1
Given two vectors over a finite domain and a function , the convolution problem asks to compute the vector whose…
cs.DS2023
Counting perfect matchings and Hamiltonian cycles faster
Baitian Li
We show that the hafnian of a symmetric matrix of -bit integers (which counts the number of perfect matchings of a -vertex graph) and the…