{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:43:36Z","timestamp":1740109416672,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,10,5]],"date-time":"2017-10-05T00:00:00Z","timestamp":1507161600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100010663","name":"H2020 European Research Council","doi-asserted-by":"publisher","award":["339691"],"award-info":[{"award-number":["339691"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1007\/s00224-017-9814-5","type":"journal-article","created":{"date-parts":[[2017,10,5]],"date-time":"2017-10-05T02:45:12Z","timestamp":1507171512000},"page":"136-161","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Size-Treewidth Tradeoffs for Circuits Computing the Element Distinctness Function"],"prefix":"10.1007","volume":"62","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7798-7446","authenticated-orcid":false,"given":"Mateus","family":"de Oliveira Oliveira","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,10,5]]},"reference":[{"key":"9814_CR1","doi-asserted-by":"crossref","unstructured":"Alekhnovich, M., Razborov, A.A.: Satisfiability, branch-width and tseitin tautologies. In: Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), pp 593\u2013603 (2002)","DOI":"10.1109\/SFCS.2002.1181983"},{"issue":"12","key":"9814_CR2","doi-asserted-by":"crossref","first-page":"297","DOI":"10.4086\/toc.2014.v010a012","volume":"10","author":"E Allender","year":"2014","unstructured":"Allender, E., Chen, S., Lou, T., Papakonstantinou, P.A., Tang, B.: Width-parametrized SAT: time\u2013space tradeoffs. Theory of Computing 10(12), 297\u2013339 (2014)","journal-title":"Theory of Computing"},{"key":"9814_CR3","doi-asserted-by":"crossref","unstructured":"Alon, N., Seymour, P., Thomas, R.: A separator theorem for graphs with an excluded minor and its applications. In: Proceedings of the 22nd Symposium on Theory of Computing (STOC 1990), pp 293\u2013299. ACM (1990)","DOI":"10.1145\/100216.100254"},{"issue":"3","key":"9814_CR4","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0304-3975(83)90029-4","volume":"28","author":"N Blum","year":"1983","unstructured":"Blum, N.: A boolean function requiring 3n network size. Theor. Comput. Sci. 28(3), 337\u2013345 (1983)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20132","key":"9814_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"HL Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theor. Comput. Sci. 209(1\u20132), 1\u201345 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"9814_CR6","doi-asserted-by":"crossref","unstructured":"Broering, E., Lokam, S.V.: Width-based algorithms for SAT and CIRCUIT-SAT. In: Proceedings of the 6th International Conference on Theory and Applications of Satisfiability Testing (SAT 2004), Volume 2919 of LNCS, pp 162\u2013171. Springer (2003)","DOI":"10.1007\/978-3-540-24605-3_13"},{"key":"9814_CR7","unstructured":"Calabro, C.: A lower bound on the size of series-parallel graphs dense in long paths. Electronic Colloquium on Computational Complexity (ECCC), 15(110) (2008)"},{"key":"9814_CR8","unstructured":"de Oliveira Oliveira, M.: Size-treewidth tradeoffs for circuits computing the element distinctness function. In: Proceedings of the 33Rd Symposium on Theoretical Aspects of Computer Science (STACS 2016), Volume 47 of LIPIcs, pp 56:1\u201356:14 (2016)"},{"key":"9814_CR9","doi-asserted-by":"crossref","unstructured":"Demenkov, E., Kulikov, A.S.: An elementary proof of a 3n \u2212 o(n) lower bound on the circuit complexity of affine dispersers. In: Proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science (MFCS 2011), Volume 6907 of LNCS, pp 256\u2013265. Springer (2011)","DOI":"10.1007\/978-3-642-22993-0_25"},{"key":"9814_CR10","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory, volume 173 of Graduate Texts in Mathematics. Springer (2000)","DOI":"10.1007\/978-3-662-53622-3_7"},{"issue":"1","key":"9814_CR11","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.ic.2004.05.002","volume":"194","author":"P Duris","year":"2004","unstructured":"Duris, P., Hromkovic, J., Jukna, S., Sauerhoff, M., Schnitger, G.: On multi-partition communication complexity. Inf. Comput. 194(1), 49\u201375 (2004)","journal-title":"Inf. Comput."},{"key":"9814_CR12","doi-asserted-by":"crossref","unstructured":"Find, M.G., Golovnev, A., Hirsch, E.A., Kulikov, A.S.: A better-than-3n lower bound for the circuit complexity of an explicit function. In: Proceedings of the 57th Annual Symposium on Foundations of Computer Science (FOCS 2016), pp 89\u201398. IEEE (2016)","DOI":"10.1109\/FOCS.2016.19"},{"key":"9814_CR13","doi-asserted-by":"crossref","unstructured":"G\u00e1l, A., Jang, J.-T.: A generalization of Spira\u2019s theorem and circuits with small segregators or separators. In: Proceedings of the 38th Conference on Theory and Practice of Computer Science (SOFSEM 2012), Volume 7147 of LNCS, pp 264\u2013276. Springer (2012)","DOI":"10.1007\/978-3-642-27660-6_22"},{"key":"9814_CR14","doi-asserted-by":"crossref","unstructured":"Georgiou, K., Papakonstantinou, P.A.: Complexity and algorithms for well-structured k-sat instances. In: Proceedings of the 11th International Conference on Theory and Applications of Satisfiability Testing (SAT 2008), Volume 4996 of LNCS, pp 105\u2013118. Springer (2008)","DOI":"10.1007\/978-3-540-79719-7_10"},{"issue":"2","key":"9814_CR15","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0020-0190(96)00095-6","volume":"59","author":"I Glaister","year":"1996","unstructured":"Glaister, I., Shallit, J.: A lower bound technique for the size of nondeterministic finite automata. Inf. Process. Lett. 59(2), 75\u201377 (1996)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"9814_CR16","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1007\/s00493-003-0037-9","volume":"23","author":"M Grohe","year":"2003","unstructured":"Grohe, M.: Local tree-width, excluded minors, and approximation algorithms. Combinatorica 23(4), 613\u2013632 (2003)","journal-title":"Combinatorica"},{"issue":"1","key":"9814_CR17","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1137\/S0097539794261556","volume":"27","author":"J H\u00e5stad","year":"1998","unstructured":"H\u00e5stad, J.: The shrinkage exponent of de morgan formulas is 2. SIAM J. Comput. 27(1), 48\u201364 (1998)","journal-title":"SIAM J. Comput."},{"key":"9814_CR18","doi-asserted-by":"crossref","unstructured":"He, J., Liang, H., Sarma, J.M.: Limiting negations in bounded treewidth and upward planar circuits. In: In Proceedings 35th International Symposium on Mathematical Foundations of Computer Science (MFCS 2010), Volume 6281 of LNCS, pp 417\u2013428. Springer (2010)","DOI":"10.1007\/978-3-642-15155-2_37"},{"issue":"02","key":"9814_CR19","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1051\/ita:1999113","volume":"33","author":"J Hromkovi\u010d","year":"1999","unstructured":"Hromkovi\u010d, J.: Communication complexity and lower bounds on multilective computations. RAIRO - Theoretical Informatics and Applications 33(02), 193\u2013212 (1999)","journal-title":"RAIRO - Theoretical Informatics and Applications"},{"key":"9814_CR20","doi-asserted-by":"crossref","unstructured":"Iwama, K., Morizumi, H.: An explicit lower bound of 5n-o(n) for boolean circuits. In: Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science (MFCS 2002), Volume 2420 of LNCS, pp 353\u2013364. Springer (2002)","DOI":"10.1007\/3-540-45687-2_29"},{"issue":"2","key":"9814_CR21","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/s00224-013-9519-3","volume":"54","author":"MJ Jansen","year":"2014","unstructured":"Jansen, M.J., Sarma, J.: Balancing bounded treewidth circuits. Theory Comput. Syst. 54(2), 318\u2013336 (2014)","journal-title":"Theory Comput. Syst."},{"key":"9814_CR22","doi-asserted-by":"crossref","unstructured":"Jukna, S.: Boolean Function Complexity: Advances and Frontiers, volume 27 of Algorithms and combinatorics. Springer (2012)","DOI":"10.1007\/978-3-642-24508-4"},{"key":"9814_CR23","doi-asserted-by":"crossref","unstructured":"Lachish, O., Raz, R.: Explicit lower bound of 4.5 n-o(n) for boolena circuits. In: Proceedings of the 33rd Annual Symposium on Theory of Computing (STOC 2001), pp 399\u2013408. ACM (2001)","DOI":"10.1145\/380752.380832"},{"issue":"3","key":"9814_CR24","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1137\/0209046","volume":"9","author":"RJ Lipton","year":"1980","unstructured":"Lipton, R.J., Tarjan, R.E.: Applications of a planar separator theorem. SIAM J. Comput. 9(3), 615\u2013627 (1980)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"9814_CR25","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/s00453-009-9312-5","volume":"59","author":"IL Markov","year":"2011","unstructured":"Markov, I.L., Shi, Y.: Constant-degree graph expansions that preserve treewidth. Algorithmica 59(4), 461\u2013470 (2011)","journal-title":"Algorithmica"},{"key":"9814_CR26","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.dam.2013.05.026","volume":"168","author":"NV Nestoridis","year":"2014","unstructured":"Nestoridis, N.V., Thilikos, D.M.: Square roots of minor closed graph classes. Discrete Appl. Math. 168, 34\u201339 (2014)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"9814_CR27","first-page":"999","volume":"7","author":"Ne\u010diporuk","year":"1966","unstructured":"Ne\u010diporuk: On a Boolean function. Soviet Math. Dokl. 7(4), 999\u20131000 (1966)","journal-title":"Soviet Math. Dokl."},{"issue":"2","key":"9814_CR28","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/0022-0000(84)90069-2","volume":"28","author":"CH Papadimitriou","year":"1984","unstructured":"Papadimitriou, C.H., Sipser, M.: Communication complexity. J. Comput. Syst. Sci. 28(2), 260\u2013269 (1984)","journal-title":"J. Comput. Syst. Sci."},{"issue":"5","key":"9814_CR29","doi-asserted-by":"crossref","first-page":"2425","DOI":"10.1007\/s10958-006-0119-5","volume":"134","author":"R Paturi","year":"2006","unstructured":"Paturi, R., Pudl\u00e1k, P.: Circuit lower bounds and linear codes. J. Math. Sci. 134(5), 2425\u20132434 (2006)","journal-title":"J. Math. Sci."},{"issue":"1","key":"9814_CR30","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1006\/jctb.1995.1006","volume":"63","author":"N Robertson","year":"1995","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. XIII. The disjoint paths problem. Journal of Combinatorial Theory, Series B 63(1), 65\u2013110 (1995)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"9814_CR31","doi-asserted-by":"crossref","unstructured":"Santhanam, R., Srinivasan, S.: On the limits of sparsification. In: Proceedings of 39th the International Conference on Automata, Languages, and Programming (ICALP 2012), Volume 7391 of LNCS, pp 774\u2013785. Springer (2012)","DOI":"10.1007\/978-3-642-31594-7_65"},{"key":"9814_CR32","doi-asserted-by":"crossref","unstructured":"Savage, J.E.: Planar circuit complexity and the performance of VLSI algorithms. In: INRIA Report 77 (1981). Also in VLSI Systems and Computations, pp 61\u201367. Computer Science Press, Rockwille, MD (1981)","DOI":"10.1007\/978-3-642-68402-9_8"},{"issue":"1","key":"9814_CR33","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/BF01277954","volume":"5","author":"G Tur\u00e1n","year":"1995","unstructured":"Tur\u00e1n, G.: On the complexity of planar boolean circuits. Comput. Complex. 5(1), 24\u201342 (1995)","journal-title":"Comput. Complex."},{"key":"9814_CR34","doi-asserted-by":"crossref","unstructured":"Valiant, L.G.: Graph-theoretic arguments in low-level complexity. In: Proceedings of the 6th Symposium on Mathematical Foundations of Computer Science, Volume 53 of LNCS, pp 162\u2013176 (1977)","DOI":"10.1007\/3-540-08353-7_135"},{"key":"9814_CR35","doi-asserted-by":"crossref","unstructured":"Wegener, I.: Branching Programs and Binary Decision Diagrams: Theory and Applications. SIAM (2000)","DOI":"10.1137\/1.9780898719789"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-017-9814-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-017-9814-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-017-9814-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T04:12:17Z","timestamp":1570162337000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-017-9814-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,5]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["9814"],"URL":"https:\/\/doi.org\/10.1007\/s00224-017-9814-5","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"type":"print","value":"1432-4350"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[2017,10,5]]}}}