{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:17:36Z","timestamp":1725455856135},"publisher-location":"Berlin\/Heidelberg","reference-count":7,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354010576X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0017293","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T07:22:34Z","timestamp":1132644154000},"page":"32-40","source":"Crossref","is-referenced-by-count":0,"title":["Netzwerke zur simultanen Berechnung Boolescher Funktionen (Ausf\u00fchrliche Kurzfassung)"],"prefix":"10.1007","author":[{"given":"J\u00fcrgen","family":"Sattler","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0304-3975(76)90089-X","volume":"2","author":"W. Paul","year":"1976","unstructured":"W. Paul: Realizing boolean functions on disjoint sets of variables Theoretical computer science 2 (1976) S. 383\u2013396","journal-title":"Theoretical computer science"},{"key":"5_CR2","unstructured":"J. Sattler: Netzwerke zur simultanen Berechnung Boolescher Funktionen. Unver\u00f6ffentlichtes Manuskript, Universit\u00e4t Frankfurt (1981)"},{"key":"5_CR3","volume-title":"The complexity of computing","author":"J. Savage","year":"1976","unstructured":"J. Savage: The complexity of computing. John Wilney, New York, (1976)"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0304-3975(76)90073-6","volume":"1","author":"C.P. Schnorr","year":"1976","unstructured":"C.P. Schnorr: The combinational complexity of equivalence. Theoretical computer science 1 (1976) S. 289\u2013295","journal-title":"Theoretical computer science"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"C.P. Schnorr: A 3n lower bound on the network complexity of boolean functions. Theoretical computer science (1980)","DOI":"10.1016\/0304-3975(80)90074-2"},{"key":"5_CR6","volume-title":"Charakterisierung aller optimalen Netzwerke zur simultanen Berechnung der Booleschen Funktionen \u201cand\u201d und \u201cnor\u201d","author":"M. Seysen","year":"1979","unstructured":"M. Seysen: Charakterisierung aller optimalen Netzwerke zur simultanen Berechnung der Booleschen Funktionen \u201cand\u201d und \u201cnor\u201d. Diplomarbeit, Frankfurt (1979)"},{"key":"5_CR7","first-page":"996","volume":"19","author":"D. Uhlig","year":"1978","unstructured":"D. Uhlig: Self-correcting contact networks that correct a large number of errors. Soviet Math. Dokl. 19 (1978) S. 996\u20131000","journal-title":"Soviet Math. Dokl."}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0017293.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:38:04Z","timestamp":1607549884000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0017293"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354010576X"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/bfb0017293","relation":{},"subject":[]}}