Author:
Paterson Michael,Zwick Uri
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference22 articles.
1. A. Avizienis, Signed-digit number representation for fast parallel arithmetic,IEEE Trans. Elect. Comput. EC-10 (1961), 389?400.
2. R. Brent, On the addition of binary numbers,IEEE Trans. Comput. C-19 (1970), 758?759.
3. R. Boppana, M. Sipser, The complexity of finite functions, inHandbook of Theoretical Computer Science Vol. A: Algorithms and Complexity, J. van Leeuwen, ed., Elsevier/MIT Press, 1990, 757?804.
4. L. Dadda, Some schemes for parallel multipliers,Alta Frequenza 34 (1965), 343?356.
5. P. E. Dunne,The Complexity of Boolean Networks, Academic Press, 1988.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. ON THE MEANING OF WORKS BY V. M. KHRAPCHENKO;Prikladnaya Diskretnaya Matematika;2020-06
2. Optimizing Obfuscation;Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security;2014-11-03
3. Upper bounds for the formula size of symmetric Boolean functions;Russian Mathematics;2014-04-29
4. Upper bounds on the depth of symmetric Boolean functions;Moscow University Computational Mathematics and Cybernetics;2013-10
5. Complexity of computation in finite fields;Journal of Mathematical Sciences;2013-05-17