×

Found 6 Documents (Results 1–6)

Newest Citations Relevance
Chen, Lijie; Williams, R. Ryan

Stronger connections between circuit analysis and circuit lower bounds, via PCPs of proximity. (English) Zbl 07564419

Shpilka, Amir (ed.), 34th computational complexity conference, CCC 2019, New Brunswick, NJ, USA, July 18–20, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 137, Article 19, 43 p. (2019).
MSC:  68Q25
Cite Review PDF
Full Text: DOI
Williams, Richard Ryan

Limits on representing Boolean functions by linear combinations of simple functions: thresholds, ReLUs, and low-degree polynomials. (English) Zbl 1441.68047

Servedio, Rocco A. (ed.), 33rd computational complexity conference, CCC 2018, June 22–24, 2018, San Diego, California, USA. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 102, Article 6, 24 p. (2018).
MSC:  68Q06 68Q17
Cite Review PDF
Full Text: DOI arXiv
Kane, Daniel M.; Williams, Ryan

Super-linear gate and super-quadratic wire lower bounds for depth-two and depth-three threshold circuits. (English) Zbl 1373.68220

Wichs, Daniel (ed.) et al., Proceedings of the 48th annual ACM SIGACT symposium on theory of computing, STOC ’16, Cambridge, MA, USA, June 19–21, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4132-5). 633-643 (2016).
MSC:  68Q05 68Q17 94C10
Cite Review PDF
Full Text: DOI arXiv

Filter Results by …

Document Type

all top 5

Author

Year of Publication

Main Field