{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T12:01:32Z","timestamp":1710244892288},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1984,8,1]],"date-time":"1984-08-01T00:00:00Z","timestamp":460166400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1984,8]]},"DOI":"10.1007\/bf00289238","type":"journal-article","created":{"date-parts":[[2004,10,4]],"date-time":"2004-10-04T23:22:27Z","timestamp":1096932147000},"page":"171-181","source":"Crossref","is-referenced-by-count":3,"title":["Characterization of all optimal networks for a simultaneous computation of AND and NOR"],"prefix":"10.1007","volume":"21","author":[{"given":"Norbert","family":"Blum","sequence":"first","affiliation":[]},{"given":"Martin","family":"Seysen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1137\/0206030","volume":"6","author":"W. Paul","year":"1977","unstructured":"Paul, W.: A 2.5n lower bound on the combinatorial complexity of Boolean functions. SIAM J. Comput. 6, 427?443 (1977)","journal-title":"SIAM J. Comput."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0304-3975(76)90089-X","volume":"2","author":"W. Paul","year":"1976","unstructured":"Paul, W.: Realizing Boolean functions on disjoint sets of variables. Theor. Comp. Sci. 2, 383?396 (1976)","journal-title":"Theor. Comp. Sci."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1145\/322123.322138","volume":"26","author":"N. Pippenger","year":"1979","unstructured":"Pippenger, N., Fischer, M.J.: Relation among complexity measures. JACM 26, 361?381 (1979)","journal-title":"JACM"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"660","DOI":"10.1145\/321724.321731","volume":"19","author":"J.E. Savage","year":"1972","unstructured":"Savage, J.E.: Computional work and time on finite machines. JACM 19, 660?674 (1972)","journal-title":"JACM"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF00265223","volume":"7","author":"C.P. Schnorr","year":"1976","unstructured":"Schnorr, C.P.: The network complexity and the Turing machine complexity of finite functions. Acta Informat. 7, 95?107 (1976)","journal-title":"Acta Informat."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0304-3975(76)90073-6","volume":"1","author":"C.P. Schnorr","year":"1976","unstructured":"Schnorr, C.P.: The combinatorial complexity of equivalence. Theor. Comp. Sci. 1, 289?295 (1976)","journal-title":"Theor. Comp. Sci."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289238.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00289238\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289238","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T17:14:45Z","timestamp":1554743685000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00289238"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,8]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1984,8]]}},"alternative-id":["BF00289238"],"URL":"https:\/\/doi.org\/10.1007\/bf00289238","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1984,8]]}}}