Average-case lower bounds and satisfiability algorithms for small threshold circuits
- Submitting institution
-
University of Oxford
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 1978
- Type
- D - Journal article
- DOI
-
10.4086/toc.2018.v014a009
- Title of journal
- Theory of Computing
- Article number
- ARTN 9
- First page
- 1
- Volume
- 14
- Issue
- -
- ISSN
- 1557-2862
- Open access status
- Compliant
- Month of publication
- June
- Year of publication
- 2018
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
-
- Citation count
- 2
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper gives the first average-case lower bounds for explicit problems against constant-depth threshold circuits with a superlinear number of gates, and also the first non-trivial satisfiability algorithms for such circuits. In particular, the paper improves the main result of "Size-depth Tradeoffs for Threshold Circuits" by Impagliazzo, Paturi, and Saks in SICOMP 1997 (https://doi.org/10.1137/S0097539792282965) from a worst-case lower bound to an average-case lower bound. This paper was one of five papers invited to the Special Issue for Selected Papers from CCC (Computational Complexity Conference) 2016.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -