{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:21:36Z","timestamp":1725891696779},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642153303"},{"type":"electronic","value":"9783642153310"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15331-0_9","type":"book-chapter","created":{"date-parts":[[2010,9,7]],"date-time":"2010-09-07T05:11:25Z","timestamp":1283836285000},"page":"131-145","source":"Crossref","is-referenced-by-count":3,"title":["Non-deterministic Boolean Proof Nets"],"prefix":"10.1007","author":[{"given":"Virgile","family":"Mogbil","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"9_CR1","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1145\/76359.76370","volume":"36","author":"E.W. Allender","year":"1989","unstructured":"Allender, E.W.: P-uniform circuit complexity. Journal of the Association for Computing Machinery\u00a036(4), 912\u2013928 (1989)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"9_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-444-88071-0.50019-9","volume-title":"The complexity of finite functions","author":"R.B. Boppana","year":"1990","unstructured":"Boppana, R.B., Sipser, M.: The complexity of finite functions. MIT Press, Cambridge (1990)"},{"issue":"1-3","key":"9_CR3","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","volume":"64","author":"S.A. Cook","year":"1985","unstructured":"Cook, S.A.: A taxonomy of problems with fast parallel algorithms. Inf. Control\u00a064(1-3), 2\u201322 (1985)","journal-title":"Inf. Control"},{"issue":"3","key":"9_CR4","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01622878","volume":"28","author":"V. Danos","year":"1989","unstructured":"Danos, V., Regnier, L.: The structure of multiplicatives. Archive for Mathematical Logic\u00a028(3), 181\u2013203 (1989)","journal-title":"Archive for Mathematical Logic"},{"issue":"1","key":"9_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.Y. Girard","year":"1987","unstructured":"Girard, J.Y.: Linear logic. Theor. Comput. Sci.\u00a050(1), 1\u2013102 (1987)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR6","unstructured":"Girard, J.Y.: Proof-nets: the parallel syntax for proof theory. Logic and Algebra\u00a0180 (1996)"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/3-540-44904-3_17","volume-title":"Typed Lambda Calculi and Applications","author":"F. Maurel","year":"2003","unstructured":"Maurel, F.: Nonderministic light logics and NP-time. In: Hofmann, M.O. (ed.) TLCA 2003. LNCS, vol.\u00a02701, pp. 241\u2013255. Springer, Heidelberg (2003)"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-540-72734-7_28","volume-title":"Logical Foundations of Computer Science","author":"V. Mogbil","year":"2007","unstructured":"Mogbil, V., Rahli, V.: Uniform circuits, & boolean proof nets. In: Artemov, S., Nerode, A. (eds.) LFCS 2007. LNCS, vol.\u00a04514, pp. 401\u2013421. Springer, Heidelberg (2007)"},{"issue":"5","key":"9_CR9","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1109\/12.24282","volume":"38","author":"I. Parberry","year":"1989","unstructured":"Parberry, I.: A note on nondeterminism in small, fast parallel computers. IEEE Transactions on Computers\u00a038(5), 766\u2013767 (1989)","journal-title":"IEEE Transactions on Computers"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/0022-0000(81)90038-6","volume":"21","author":"W. Ruzzo","year":"1981","unstructured":"Ruzzo, W.: On uniform circuit complexity. J. of Computer and System Science\u00a021, 365\u2013383 (1981)","journal-title":"J. of Computer and System Science"},{"key":"9_CR11","first-page":"182","volume-title":"Proceedings IEEE Logic in Computer Science","author":"K. Terui","year":"2004","unstructured":"Terui, K.: Proof nets and boolean circuits. In: Proceedings IEEE Logic in Computer Science, pp. 182\u2013191. IEEE Computer Society, Los Alamitos (2004)"},{"key":"9_CR12","series-title":"Texts in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03927-4","volume-title":"Introduction to Circuit Complexity \u2013 A Uniform Approach","author":"H. Vollmer","year":"1999","unstructured":"Vollmer, H.: Introduction to Circuit Complexity \u2013 A Uniform Approach. Texts in Theoretical Computer Science. Springer, Heidelberg (1999)"},{"issue":"2","key":"9_CR13","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0304-3975(92)00014-I","volume":"125","author":"M.J. Wolf","year":"1994","unstructured":"Wolf, M.J.: Nondeterministic circuits, space complexity and quasigroups. Theoretical Computer Science\u00a0125(2), 295\u2013313 (1994)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Foundational and Practical Aspects of Resource Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15331-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T00:32:08Z","timestamp":1553041928000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15331-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642153303","9783642153310"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15331-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}