{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:30:52Z","timestamp":1759638652398},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540727323"},{"type":"electronic","value":"9783540727347"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72734-7_28","type":"book-chapter","created":{"date-parts":[[2007,6,28]],"date-time":"2007-06-28T09:40:50Z","timestamp":1183023650000},"page":"401-421","source":"Crossref","is-referenced-by-count":4,"title":["Uniform Circuits, & Boolean Proof Nets"],"prefix":"10.1007","author":[{"given":"Virgile","family":"Mogbil","sequence":"first","affiliation":[]},{"given":"Vincent","family":"Rahli","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"28_CR1","doi-asserted-by":"crossref","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"},{"issue":"3","key":"28_CR2","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/0022-0000(90)90022-D","volume":"41","author":"D.A.M. Barrington","year":"1990","unstructured":"Barrington, D.A.M., Immerman, N., Straubing, H.: On uniformity within NC1. J. of Comput. and System Science\u00a041(3), 274\u2013306 (1990)","journal-title":"J. of Comput. and System Science"},{"key":"28_CR3","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)"},{"key":"28_CR4","unstructured":"Cook, S., Krajicek, J.: Consequences of the provability of NP\u2286P\/poly (2006)"},{"key":"28_CR5","unstructured":"Danos, V.: La logique lin\u00e9aire appliqu\u00e9e \u00e0 l\u2019\u00e9tude de divers processus de normalisation (et principalement du \u03bb-calcul). PhD thesis, Univ. Paris VII (1990)"},{"issue":"3","key":"28_CR6","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":"28_CR7","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":"28_CR8","unstructured":"Hughes, D.J.D., van Glabbeek, R.J.: Proof nets for unit-free multiplicative-additive linear logic. In: Proc. IEEE Logic in Comput. Sci. (2003)"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Hughes, D.J.D., van Glabbeek, R.J.: Proof nets for unit-free multiplicative-additive linear logic. ACM Trans. on Comput. Logic (2005)","DOI":"10.1145\/1094622.1094629"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Karp, R., Lipton, R.: Some connections between nonuniform and uniform complexity classes. In: Proc. 12th ACM Symp. on Theory of Computing, pp. 302\u2013309 (1980)","DOI":"10.1145\/800141.804678"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Laurent, O., Tortora de Falco, L.: Slicing polarized additive normalization. In: Linear Logic in Computer Science (2004)","DOI":"10.1017\/CBO9780511550850.008"},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-540-45208-9_4","volume":"2841","author":"H. Mairson","year":"2003","unstructured":"Mairson, H., Terui, K.: On the computational complexity of cut-elimination in linear logic. Theoretical Computer Science\u00a02841, 23\u201336 (2003)","journal-title":"Theoretical Computer Science"},{"key":"28_CR13","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":"28_CR14","doi-asserted-by":"crossref","unstructured":"Terui, K.: Proof nets and boolean circuits. In: Proc. IEEE Logic in Comput. Sci., pp. 182\u2013191 (2004)","DOI":"10.1109\/LICS.2004.1319612"},{"issue":"3","key":"28_CR15","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/S0304-3975(01)00176-1","volume":"294","author":"L. Tortora De Falco","year":"2003","unstructured":"Tortora De Falco, L.: Additives of linear logic and normalization - part i: a (restricted) church-rosser property. T.C.S.\u00a0294(3), 489\u2013524 (2003)","journal-title":"T.C.S."},{"issue":"4","key":"28_CR16","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1137\/0221040","volume":"21","author":"H. Venkateswaran","year":"1992","unstructured":"Venkateswaran, H.: Circuit definitions of nondeterministic complexity classes. Siam J. Comput.\u00a021(4), 655\u2013670 (1992)","journal-title":"Siam J. Comput."},{"key":"28_CR17","series-title":"Texts in Theoretical Computer Science","doi-asserted-by":"crossref","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":"28_CR18","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","Logical Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72734-7_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,23]],"date-time":"2020-04-23T19:19:15Z","timestamp":1587669555000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72734-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540727323","9783540727347"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72734-7_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}