Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits
Work
Year: 2018
Type: article
Abstract: We show average-case lower bounds for explicit Boolean functions against bounded-depth threshold circuits with a superlinear number of wires. We show that for each integer $d > 1,$ there is a constant... more
Source: Theory of Computing
Cites: 55
Cited by: 12
Related to: 10
FWCI: 0.692
Citation percentile (by year/subfield): 82.83
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid