Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,Computer Science Applications,Numerical Analysis,Theoretical Computer Science,Software
Reference4 articles.
1. Lupanov: Über den Schaltaufwand bei der Realisierung logischer Funktionen. (Probleme der Kybernetik, Band 3.)
2. Schnorr, C. P.: Lower Bounds for the Product of Time and Space Requirements of Turing Machine Computations. Proceedings of MFCS High Tatras, September 3–8, 1973, 153–163.
3. Strassen: Berechnung und Programm 1. Acta Informatica1972, 320–335.
4. Strassen: Berechnung in partiellen Algebren. Computing11, 181–196 (1973).
Cited by
51 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. Improvement of circuit complexity lower bound for parity function in one infinite basis;Proceedings of Academician O.B. Lupanov 14th International Scientific Seminar "Discrete Mathematics and Its Applications";2022
4. Circuit complexity lower bound for parity function in one infinite basis;Mathematical Problems of Cybernetics;2022
5. On the Power of Nondeterministic Circuits and Co-Nondeterministic Circuits;Language and Automata Theory and Applications;2021