Weighted Gate Elimination-Reference-Cited by-同舟云学术

Weighted Gate Elimination

Published:2016-01-14 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science
language:
Short-container-title:

Author:

Golovnev Alexander¹,Kulikov Alexander S.²

Affiliation:

1. New York University, New York, NY, USA

2. Russian Academy of Sciences, St. Petersburg, Russian Fed.

Funder

Government of the Russian Federation

National Science Foundation

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/2840728.2840755

Reference21 articles.

1. Extractors for Polynomials Sources over Constant-Size Fields of Small Characteristic

2. Affine dispersers from subspace polynomials

3. A Boolean function requiring 3n network size

4. Gil Cohen and Avishay Tal. Two structural results for low degree polynomials and applications. arXiv preprint arXiv:1404.0654 2014. Gil Cohen and Avishay Tal. Two structural results for low degree polynomials and applications. arXiv preprint arXiv:1404.0654 2014.

5. New upper bounds on the Boolean circuit complexity of symmetric functions

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Improving $$3N$$ Circuit Complexity Lower Bounds;computational complexity;2023-12

2. 3.1 n − o ( n ) circuit lower bounds for explicit functions;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09

3. On the limits of gate elimination;Journal of Computer and System Sciences;2018-09

4. Gate elimination: Circuit size lower bounds and #SAT upper bounds;Theoretical Computer Science;2018-04

5. A Better-Than-3n Lower Bound for the Circuit Complexity of an Explicit Function;2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS);2016-10