544 citations · 653 across the 48 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2015
Basis Collapse for Holographic Algorithms Over All Domain Sizes
Sitan Chen
The theory of holographic algorithms introduced by Valiant represents a novel approach to achieving polynomial-time algorithms for seemingly intractable counting problems via a red…
cs.CC2015
Pseudorandomness for Read-Once, Constant-Depth Circuits
Sitan Chen, Thomas Steinke, Salil Vadhan
For Boolean functions computed by read-once, depth- circuits with unbounded fan-in over the de Morgan basis, we present an explicit pseudorandom generator with seed length $\til…