{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T12:49:48Z","timestamp":1770900588978,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2000,3,1]],"date-time":"2000-03-01T00:00:00Z","timestamp":951868800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4886,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,3]]},"DOI":"10.1016\/s0304-3975(99)00182-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T21:51:05Z","timestamp":1027633865000},"page":"43-57","source":"Crossref","is-referenced-by-count":58,"title":["On the multiplicative complexity of Boolean functions over the basis (\u2227,\u2295,1)"],"prefix":"10.1016","volume":"235","author":[{"given":"Joan","family":"Boyar","sequence":"first","affiliation":[]},{"given":"Ren\u00e9","family":"Peralta","sequence":"additional","affiliation":[]},{"given":"Denis","family":"Pochuev","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00182-6_BIB1","doi-asserted-by":"crossref","unstructured":"J. Boyar, R. Peralta, Short Discreet Proofs, Advances in Cryptology: Proc. Eurocrypt \u201996, Lecture Notes in Computer Science, vol. 1070, Springer, Berlin, 1996, pp. 131\u2013142.","DOI":"10.1007\/3-540-68339-9_12"},{"key":"10.1016\/S0304-3975(99)00182-6_BIB2","unstructured":"P. B\u00fcrgisser, M. Clausen, M. Amin Shokrollahi, Algebraic Complexity Theory, Grundlehren der mathematischen Wissenschaften, vol. 315, Springer, Berlin."},{"key":"10.1016\/S0304-3975(99)00182-6_BIB3","unstructured":"P. Dunne, The Complexity of Boolean Networks, Academic Press, New York, 1988, pp. 112\u2013115."},{"key":"10.1016\/S0304-3975(99)00182-6_BIB4","unstructured":"R. Graham, D. Knuth, O. Patashnik, Concrete Mathematics: A Foundation for Computer Science, 2nd Ed., Addison-Wesley, Reading, MA, 1994, p. 114."},{"key":"10.1016\/S0304-3975(99)00182-6_BIB5","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0304-3975(92)90235-8","article-title":"The multiplicative complexity ofquadratic boolean forms","volume":"102","author":"Mirwald","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00182-6_BIB6","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1145\/321879.321882","article-title":"Bounds to complexities of networks for sorting and for switching","volume":"22","author":"Muller","year":"1975","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0304-3975(99)00182-6_BIB7","first-page":"170","article-title":"On the complexity of calculating the elementary symmetric functions over finite fields","volume":"20","author":"Miha\u0131\u030cljuk","year":"1979","journal-title":"Sov. Math. Dokl."},{"key":"10.1016\/S0304-3975(99)00182-6_BIB8","doi-asserted-by":"crossref","unstructured":"W.J. Paul, A 2.5n lower bound on the combinational complexity of Boolean functions, Proc. 7th Ann. ACM Symp. on Theory of Computing, 1975, pp. 27\u201336.","DOI":"10.1145\/800116.803750"},{"key":"10.1016\/S0304-3975(99)00182-6_BIB9","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/j.1538-7305.1949.tb03624.x","article-title":"The synthesis of two-terminal networks","volume":"28","author":"Shannon","year":"1949","journal-title":"Bell System Tech. J."},{"key":"10.1016\/S0304-3975(99)00182-6_BIB10","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/BF01683282","article-title":"On the combinational complexity of certain symmetric boolean functions","volume":"10","author":"Stockmeyer","year":"1977","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0304-3975(99)00182-6_BIB11","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01436566","article-title":"Die Berechnungskomplexit\u00e4t von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten","volume":"20","author":"Strassen","year":"1973","journal-title":"Numer. Math."},{"key":"10.1016\/S0304-3975(99)00182-6_BIB12","unstructured":"B.L. van der Waerden, Algebra, Frederick Ungar, New York."},{"key":"10.1016\/S0304-3975(99)00182-6_BIB13","doi-asserted-by":"crossref","unstructured":"I. Wegener, The Complexity of Boolean functions, Wiley\u2013Teubner Series in Computer Science, Wiley, New York, 1987.","DOI":"10.1007\/3-540-18170-9_185"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001826?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001826?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T19:19:45Z","timestamp":1580843985000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599001826"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,3]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,3]]}},"alternative-id":["S0304397599001826"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00182-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,3]]}}}