New Lower Bounds on Circuit Size of Multi-output Functions-Reference-Cited by-同舟云学术

New Lower Bounds on Circuit Size of Multi-output Functions

Published:2014-10-28 Issue:4 Volume:56 Page:630-642
ISSN:1432-4350
Container-title:Theory of Computing Systems
language:en
Short-container-title:Theory Comput Syst

Author:

Demenkov Evgeny,Kulikov Alexander S.,Melanich Olga,Mihajlin Ivan

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00224-014-9590-4.pdf

Reference18 articles.

1. Blum, N.: A Boolean function requiring 3n network size. Theor. Comput. Sci. 28, 337–345 (1984)

2. Blum, N., Seysen, M.: Characterization of all optimal networks for a simultaneous computation of AND and NOR. Acta. Informatica 21(2), 171–181 (1984)

3. Chashkin, A.V.: On complexity of Boolean matrices, graphs and corresponding Boolean matrices. Diskretnaya matematika 6(2), 43–73 (1994). in Russian

4. Demenkov, E., Kulikov, A.S.: An elementary proof of a 3n − o(n) lower bound on the circuit complexity of affine dispersers. In: Proceedings of 36th International Symposium on Mathematical Foundations of Computer Science (MFCS), Springer, Lecture Notes in Computer Science, Vol. 6907, pp 256–265 (2011)

5. Gashkov, S.B., Kochergin, V.V.: On addition chains of vectors, gate circuits, and the complexity of computations of powers. Sib. Adv. Math. 4(4), 1–16 (1994)

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

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

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

3. 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