Author:
Demenkov Evgeny,Kulikov Alexander S.
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Shannon, C.E.: The synthesis of two-terminal switching circuits. Bell System Technical Journal 28, 59–98 (1949)
2. Blum, N.: A Boolean function requiring 3n network size. Theoretical Computer Science 28, 337–345 (1984)
3. Iwama, K., Lachish, O., Morizumi, H., Raz, R.: An explicit lower bound of 5n − o(n) for boolean circuits (2005) (unpublished manuscript),
http://www.wisdom.weizmann.ac.il/~ranraz/publications/Podedl.ps
4. Ben-Sasson, E., Kopparty, S.: Affine dispersers from subspace polynomials. In: Proceedings of the Annual Symposium on Theory of Computing (STOC), vol. 679, pp. 65–74. ACM Press, New York (2009)
5. Boyar, J., Peralta, R.: Tight bounds for the multiplicative complexity of symmetric functions. Theoretical Computer Science 396, 223–246 (2008)
Cited by
25 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Improving $$3N$$ Circuit Complexity Lower Bounds;computational complexity;2023-12
2. Two Source Extractors for Asymptotically Optimal Entropy, and (Many) More;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
3. 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
4. The exact complexity of pseudorandom functions and the black-box natural proof barrier for bootstrapping results in computational complexity;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09
5. Affine Extractors for Almost Logarithmic Entropy;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02