{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:25:49Z","timestamp":1759638349575,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1109\/lics.2004.1319612","type":"proceedings-article","created":{"date-parts":[[2004,11,13]],"date-time":"2004-11-13T00:14:14Z","timestamp":1100304854000},"page":"182-191","source":"Crossref","is-referenced-by-count":9,"title":["Proof nets and Boolean circuits"],"prefix":"10.1109","author":[{"given":"K.","family":"Terui","sequence":"first","affiliation":[]}],"member":"263","reference":[{"journal-title":"The Complexity of Boolean Functions","year":"1987","author":"wegener","key":"17"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28404"},{"journal-title":"Introduction to Circuit Complexity","year":"1998","author":"vollmer","key":"16"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45208-9_4"},{"key":"14","first-page":"598","article-title":"Lower bounds on the size of bounded depth networks over a complete basis with logical addition","volume":"41","author":"razborov","year":"1987","journal-title":"Matematicheskije Zametki"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00297-3"},{"key":"12","article-title":"Linear lambda calculus and polynomial time","author":"mairson","year":"0","journal-title":"Journal of Functional Programming"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1007\/BF01744431"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01622878"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-444-88071-0.50019-9"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511629150.012"},{"key":"7","first-page":"1","article-title":"Proof nets for unit-free multiplicative-additive linear logic","author":"hughes","year":"2003","journal-title":"Proceedings of LICS 2003"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1999.782640"},{"key":"5","article-title":"Proof-nets: The parallel syntax for proof-theory","author":"girard","year":"1996","journal-title":"Logic and Algebra"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90045-4"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511529948"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1137\/0403021"}],"event":{"name":"Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.","start":{"date-parts":[[2004,7,17]]},"location":"Turku, Finland","end":{"date-parts":[[2004,7,17]]}},"container-title":["Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9221\/29239\/01319612.pdf?arnumber=1319612","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,14]],"date-time":"2017-03-14T02:33:20Z","timestamp":1489458800000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1319612\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/lics.2004.1319612","relation":{},"subject":[],"published":{"date-parts":[[2004]]}}}