hsfzLZH1's Homepage
2026
- Counting solutions faster than the Exponential Time Hypothesis allows
- Matrix multiplication with exponent at most nine quarters
- A cubic permanent–determinant lower bound
- Integer multiplication below n log n
- Optimal-order randomized k-server on arbitrary metrics
- One-sample matroid prophet inequalities against an almighty adversary
- Beyond the square-root exponent for depth-three circuits
- Approximate counting and entropy of perfect matchings
- Approximate counting of common integer polymatroid bases
- Uniform identity testing for noncommutative formulas