13 citations · 42 across the 23 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2026
Stable algorithms cannot reliably find isolated perceptron solutions
Shuyang Gong, Brice Huang, Shuangping Li +1
We study the binary perceptron, a random constraint satisfaction problem that asks to find a Boolean vector in the intersection of independently chosen random halfspaces. A strikin…
cs.CC2021
The Algorithmic Phase Transition of Random -SAT for Low Degree Polynomials
Guy Bresler, Brice Huang
Let be a uniformly random -SAT formula with variables and clauses. We study the algorithmic task of finding a satisfying assignment of . It is known that satisfyi…