{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:36Z","timestamp":1725662916194},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540074076"},{"type":"electronic","value":"9783540379232"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1975]]},"DOI":"10.1007\/3-540-07407-4_10","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:56:21Z","timestamp":1330185381000},"page":"83-92","source":"Crossref","is-referenced-by-count":0,"title":["The network-complexity of equivalence and other applications of the network complexity"],"prefix":"10.1007","author":[{"given":"C. P.","family":"Schnorr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,25]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The Complexity of Theorem-Proving Procedures. Symposium on Theory of Computing 1971. 151\u2013158","DOI":"10.1145\/800157.805047"},{"key":"10_CR2","unstructured":"Fischer, M.J.: Lectures on Network Complexity. Preprint Universit\u00e4t Frankfurt, 1974"},{"key":"10_CR3","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R. M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among Combinatorial Problems. in: Complexity of Computer Computations. R.E. Miller and J.W. Thatcher, Eds., Plenum Press, New York (1972) 85\u2013104"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Paul, W.J.: 2.25N \u2014 Lower Bound on the Combinational Complexity of Boolean Functions. Symposium on Theory of Computing, 1975","DOI":"10.1145\/800116.803750"},{"key":"10_CR5","unstructured":"Schnorr, C.P.: The Combinational Complexity of Equivalence. Preprint Universit\u00e4t Frankfurt 1975, to appear in Theoretical Computer Science"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Schnorr, C.P.: Zwei lineare untere Schranken f\u00fcr die Komplexit\u00e4t Boolescher Funktionen. Computing 13, (1974)","DOI":"10.1007\/BF02246615"},{"key":"10_CR7","unstructured":"Schnorr, C.P.: The Network Complexity and the Turing Machine Complexity of Finite Functions. Preprint Universit\u00e4t Frankfurt, 1975"},{"key":"10_CR8","unstructured":"Schnorr, C.P.: Satisfiability is Quasi-Linear Complete in NQL. Preprint Universit\u00e4t Frankfurt, 1975."}],"container-title":["Lecture Notes in Computer Science","Automata Theory and Formal Languages 2nd GI Conference Kaiserslautern, May 20\u201323, 1975"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-07407-4_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:57:30Z","timestamp":1605643050000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-07407-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975]]},"ISBN":["9783540074076","9783540379232"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-07407-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1975]]}}}