On the multiplicative complexity of Boolean functions over the basis (∧,⊕,1)-Reference-Cited by-同舟云学术

On the multiplicative complexity of Boolean functions over the basis (∧,⊕,1)

Published:2000-03 Issue:1 Volume:235 Page:43-57
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Boyar Joan,Peralta René,Pochuev Denis

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference13 articles.

1. J. Boyar, R. Peralta, Short Discreet Proofs, Advances in Cryptology: Proc. Eurocrypt ’96, Lecture Notes in Computer Science, vol. 1070, Springer, Berlin, 1996, pp. 131–142.

2. P. Bürgisser, M. Clausen, M. Amin Shokrollahi, Algebraic Complexity Theory, Grundlehren der mathematischen Wissenschaften, vol. 315, Springer, Berlin.

3. P. Dunne, The Complexity of Boolean Networks, Academic Press, New York, 1988, pp. 112–115.

4. R. Graham, D. Knuth, O. Patashnik, Concrete Mathematics: A Foundation for Computer Science, 2nd Ed., Addison-Wesley, Reading, MA, 1994, p. 114.

5. The multiplicative complexity ofquadratic boolean forms;Mirwald;Theoret. Comput. Sci.,1992

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

1. Garbled Circuits Reimagined: Logic Synthesis Unleashes Efficient Secure Computation;Cryptography;2023-11-23

2. Generating Lower-Cost Garbled Circuits: Logic Synthesis Can Help;2023 IEEE International Symposium on Hardware Oriented Security and Trust (HOST);2023-05-01

3. Autosymmetric and D-reducible Functions: Theory and Application to Security;Advanced Boolean Techniques;2023

4. Multiplicative Complexity of XOR Based Regular Functions;IEEE Transactions on Computers;2022-11-01

5. A Versatile Mapping Approach for Technology Mapping and Graph Optimization;2022 27th Asia and South Pacific Design Automation Conference (ASP-DAC);2022-01-17