Improving $$3N$$ Circuit Complexity Lower Bounds-Reference-Cited by-同舟云学术

Improving $$3N$$ Circuit Complexity Lower Bounds

Published:2023-12 Issue:2 Volume:32 Page:
ISSN:1016-3328
Container-title:computational complexity
language:en
Short-container-title:comput. complex.

Author:

Find Magnus Gausdal,Golovnev Alexander,Hirsch Edward A.,Kulikov Alexander S.

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science

Link

https://link.springer.com/content/pdf/10.1007/s00037-023-00246-9.pdf

Reference69 articles.

1. Kazuyuki Amano & Jun Tarui (2011). A well-mixed function with circuit complexity 5n: Tightness of the Lachish-Raz-type bounds. Theor. Comput. Sci. 412(18), 1646-1651. URL http://dx.doi.org/10.1016/j.tcs.2010.12.040.

2. Alexander E. Andreev (1987). On a method for obtaining more than quadratic effective lower bounds for the complexity of $$\prod$$-schemes. Moscow Univ. Math. Bull. 42(1), 63-66.

3. Eli Ben-Sasson & Ariel Gabizon (2012). Extractors for polynomials sources over constant-size fields of small characteristic. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 399-410. Springer.

4. Eli Ben-Sasson & Swastik Kopparty (2009). Affine dispersers from subspace polynomials. In Proceedings of the Annual Symposium on Theory of Computing (STOC), volume 679, 65-74. ACM Press. ISBN 9781605585062. URL http://portal.acm.org/citation.cfm?doid=1536414.1536426.

5. Eli Ben-Sasson & Emanuele Viola (2014). Short PCPs with Projection Queries. In Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I, Javier Esparza, Pierre Fraigniaud, Thore Husfeldt & Elias Koutsoupias, editors, volume 8572 of Lecture Notes in Computer Science, 163-173. Springer. ISBN 978-3-662-43947-0. URL http://dx.doi.org/10.1007/978-3-662-43948-7.