{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:59:29Z","timestamp":1725796769633},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319097039"},{"type":"electronic","value":"9783319097046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09704-6_16","type":"book-chapter","created":{"date-parts":[[2014,7,11]],"date-time":"2014-07-11T05:43:21Z","timestamp":1405057401000},"page":"174-185","source":"Crossref","is-referenced-by-count":0,"title":["Biclique Coverings, Rectifier Networks and the Cost of \u03b5-Removal"],"prefix":"10.1007","author":[{"given":"Szabolcs","family":"Iv\u00e1n","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c1d\u00e1m D.","family":"Lelkes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Judit","family":"Nagy-Gy\u00f6rgy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bal\u00e1zs","family":"Sz\u00f6r\u00e9nyi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gy\u00f6rgy","family":"Tur\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Berman, P., Bhattacharyya, A., Grigorescu, E., Raskhodnikova, S., Woodruff, D.P., Yaroslavtsev, G.: Steiner transitive-closure spanners of low-dimensional posets. Combinatorica, 1\u201324 (2014)","DOI":"10.1007\/s00493-014-2833-9"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Blum, N.: More on the power of chain rules in context-free grammars. Theoretical Computer Science\u00a027(3), 287\u2013295 (1983), Special Issue Ninth International Colloquium on Automata, Languages and Programming (ICALP), Aarhus, Summer (1982)","DOI":"10.1016\/0304-3975(82)90122-0"},{"issue":"1-2","key":"16_CR3","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.tcs.2007.02.063","volume":"380","author":"J. Hromkovic","year":"2007","unstructured":"Hromkovic, J., Schnitger, G.: Comparing the size of NFAs with and without \u03b5-transitions. Theor. Comput. Sci.\u00a0380(1-2), 100\u2013114 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/BFb0023448","volume-title":"STACS 97","author":"J. Hromkovic","year":"1997","unstructured":"Hromkovic, J., Seibert, S., Wilke, T.: Translating regular expressions into small epsilon-free nondeterministic finite automata. In: Reischuk, R., Morvan, M. (eds.) STACS 1997. LNCS, vol.\u00a01200, pp. 55\u201366. Springer, Heidelberg (1997)"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Jukna, S.: Boolean Function Complexity - Advances and Frontiers. Algorithms and combinatorics, vol.\u00a027. Springer (2012)","DOI":"10.1007\/978-3-642-24508-4"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Jukna, S.: Computational complexity of graphs. In: Dehmer, M., Emmert-Streib, F. (eds.) Advances in Network Complexity, pp. 99\u2013153. Wiley (2013)","DOI":"10.1002\/9783527670468.ch05"},{"issue":"1","key":"16_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/0400000063","volume":"9","author":"S. Jukna","year":"2013","unstructured":"Jukna, S., Sergeev, I.: Complexity of linear Boolean operators. Foundations and Trends in Theoretical Computer Science\u00a09(1), 1\u2013123 (2013)","journal-title":"Foundations and Trends in Theoretical Computer Science"},{"issue":"3","key":"16_CR8","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/BF01261323","volume":"16","author":"J. Koll\u00e1r","year":"1996","unstructured":"Koll\u00e1r, J., R\u00f3nyai, L., Szab\u00f3, T.: Norm-graphs and bipartite Tur\u00e1n numbers. Combinatorica\u00a016(3), 399\u2013406 (1996)","journal-title":"Combinatorica"},{"key":"16_CR9","first-page":"209","volume":"26","author":"L. Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz, L.: A kombinatorika minimax t\u00e9teleir\u0151l. Matematikai Lapok\u00a026, 209\u2013264 (1975)","journal-title":"Matematikai Lapok"},{"key":"16_CR10","first-page":"1171","volume":"111","author":"O.B. Lupanov","year":"1956","unstructured":"Lupanov, O.B.: On rectifier and switching-and-rectifier schemes. Dokl. Akad. Nauk SSSR\u00a0111, 1171\u20131174 (1956)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/3-540-09526-8_36","volume-title":"Mathematical Foundations of Computer Science 1979","author":"K. Mehlhorn","year":"1979","unstructured":"Mehlhorn, K.: Some remarks on Boolean sums. In: Becvar, J. (ed.) MFCS 1979. LNCS, vol.\u00a074, pp. 375\u2013380. Springer, Heidelberg (1979)"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Meyer, A.R., Fischer, M.J.: Economy of description by automata, grammars, and formal systems. In: SWAT (FOCS), pp. 188\u2013191. IEEE Computer Society (1971)","DOI":"10.1109\/SWAT.1971.11"},{"key":"16_CR13","first-page":"236","volume":"21","author":"E.I. Nechiporuk","year":"1971","unstructured":"Nechiporuk, E.I.: On a Boolean matrix. Systems Theory Res.\u00a021, 236\u2013239 (1971)","journal-title":"Systems Theory Res."},{"issue":"3","key":"16_CR14","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1145\/321958.321962","volume":"23","author":"N. Pippenger","year":"1976","unstructured":"Pippenger, N., Valiant, L.G.: Shifting graphs and their applications. J. ACM\u00a023(3), 423\u2013432 (1976)","journal-title":"J. ACM"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/11672142_35","volume-title":"STACS 2006","author":"G. Schnitger","year":"2006","unstructured":"Schnitger, G.: Regular expressions and nFAs without e-transitions. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 432\u2013443. Springer, Heidelberg (2006)"},{"issue":"2","key":"16_CR16","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF00263988","volume":"13","author":"I. Wegener","year":"1980","unstructured":"Wegener, I.: A new lower bound on the monotone network complexity of Boolean sums. Acta Informatica\u00a013(2), 109\u2013114 (1980)","journal-title":"Acta Informatica"},{"key":"16_CR17","unstructured":"Wegener, I.: The Complexity of Boolean Functions. John Wiley & Sons, Inc., New York (1987)"},{"key":"16_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921735","volume-title":"The Design of Approximation Algorithms","author":"D.P. Williamson","year":"2011","unstructured":"Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms, 1st edn. Cambridge University Press, New York (2011)","edition":"1"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09704-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T04:48:51Z","timestamp":1558932531000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-09704-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319097039","9783319097046"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09704-6_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}