{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:59:42Z","timestamp":1725663582579},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540534143"},{"type":"electronic","value":"9783540468691"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-53414-8_51","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:02:47Z","timestamp":1330189367000},"page":"278-287","source":"Crossref","is-referenced-by-count":1,"title":["Area time squared and area complexity of VLSI computations is strongly unclosed under union and intersection"],"prefix":"10.1007","author":[{"given":"Juraj","family":"Waczul\u00edk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"AHO,A.V. \u2014 ULLMAN,J.D. \u2014 YANAKAKIS,M.: On notions of information transfer in VLSI circuits. In: Proc. 15th ACM STOC, ACM 1983, pp. 133\u2013139.","DOI":"10.1145\/800061.808742"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"\u010eUPI\u0160,P. \u2014 GALIL,Z. \u2014 SCHNITGER,G.: Lower bounds on communication complexity. In: Proc. 16th ACM Symp. on Theory of Computing, ACM 1984,pp.81\u201391.","DOI":"10.1145\/800057.808668"},{"key":"25_CR3","unstructured":"GUBA\u0160,X. \u2014 WACZUL\u00cdK,J.: Closure properties of the complexity measures A and AT2. \u0160VO\u010c 1987, section VLSI and computer graphics. Comenius University, Bratislava 1987, (in Slovak) 25 p."},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"HAJNAL,A. \u2014 MAASS,W. \u2014 TURAN,G.: On the communication complexity of graph properties. In: Proc. 20th Annual ACM STOC, ACM 1988, pp. 186\u2013191.","DOI":"10.1145\/62212.62228"},{"issue":"1","key":"25_CR5","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/S0021-9800(66)80059-5","volume":"1","author":"L.H. Harper","year":"1966","unstructured":"HARPER, L.H.: Optimal numbering and isoperimetrical problems on graphs. Journ. of combinatorial theory, 1966, v. 1, no. 1 pp. 385\u2013393.","journal-title":"Journ. of combinatorial theory"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"HROMKOVI\u010c,J.: Lower bound techniques for VLSI algorithms. In: Proc. IMYCS'86, Hungarian Academy of Sciences, Budapest 1986, pp. 9\u201319. (also in: Treds, Techniques, and Problems in Theoretical Computer Science (Alica Kelemenov\u00e1 Jozef Kelemen Eds.), Lecture Notes in Computer Science 281, Springer-Verlag, Berlin 1987, pp.2\u201325.)","DOI":"10.1007\/3540185356_27"},{"key":"25_CR7","unstructured":"HROMKOVI\u010c,J.: Same complexity aspects of VLSI computations. Part 1. A framework for the study of information transfer in VLSI circuits. Computers and Artificial Intelligence, Vol. 7, 1988, No. 3, 229\u2013252 pp."},{"key":"25_CR8","unstructured":"HROMKOVI\u010c,J.: Some complexity aspects of VLSI computations. Part 2. Topology of circuits and information transfer. Computers and Artificial Intelligence, Vol. 7, 1988, No. 4, 289\u2013302 pp."},{"key":"25_CR9","unstructured":"HROMKOVI\u010c,J. \u2014 PARDUBSK\u00c1,D.: Same complexity aspects of VLSI computations. Part 3. On the power of input bit permutation in tree and trellis automata. Computers and Artificial Intelligence, Vol. 7, 1988, No. 5, 397\u2013412 pp."},{"key":"25_CR10","unstructured":"HROMKOVI\u010c,J. \u2014 PARDUBSK\u00c1,D.: Same complexity aspects of VLSI computations. Part 4. VLSI circuits with programs. Computers and Artificial Intelligence, Vol. 7, 1988, No. 6, 481\u2013495 pp."},{"key":"25_CR11","unstructured":"HROMKOVI\u010c,J.: Same complexity aspects of VLSI computations. Part 5. Nondeterministic and probabilistic VLSI circuits. Computers and Artificial Intelligence, Vol. 8, 1989, No. 2, 169\u2013188 pp."},{"key":"25_CR12","unstructured":"HROMKOVI\u010c,J: Same complexity aspects of VLSI computations. Part 6. Communication complexity. Computers and Artificial Intelligence, Vol. 8, 1989, No. 3, 209\u2013255 pp."},{"key":"25_CR13","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0304-3975(88)90165-X","volume":"57","author":"J. Hromkovi\u010d","year":"1988","unstructured":"HROMKOVI\u010c, J.: The advantages of new approach to defining the communication complexity for VLSI. In: Theoretical Computer Science 57, 1988, pp. 97\u2013111.","journal-title":"Theoretical Computer Science"},{"key":"25_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1007\/BFb0015924","volume-title":"Machines, Languages and Complexity","author":"G. Jir\u00e1skov\u00e1","year":"1989","unstructured":"JIR\u00c1SKOV\u00c1, G.: Chomski hierarchy and communication complexity. In: Machines, Languages and Complexity. Lecture Notes in Computer Science 381, Springer-Verlag, Berlin 1989, pp.12\u201318."},{"key":"25_CR15","unstructured":"KURCABOV\u00c1,V.: Communication complexity. Master thesis, Dept. of Theoretical Cybernetics, Comenius University 1985 (in Slovak) 60 p."},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"LIPTON,R.J. \u2014 SEDGEWICK,R.: Lower bound for VLSI. In: Proc. 13th Annual ACM STOC, ACM 1981, pp. 300\u2013307.","DOI":"10.1145\/800076.802482"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"LOV\u00c1SZ,L. \u2014 SAKS,M.: Lattices mobius functions and communication complexity. In: Proc. 29th Annual Symposium on FOCS 1988, pp. 81\u201390.","DOI":"10.1109\/SFCS.1988.21924"},{"key":"25_CR18","unstructured":"LO\u017dKIN,S.A. \u2014 RYBKO,A.I. \u2014 SAPO\u017dENkO,A.A. \u2014 HROMKOVI\u010c,J. \u2014 \u0160KALIKOVA,N.A.: An approach to lower bound of area complexity of Boolean circuits. In: Mathematical problems in computation theory, Banach Center Publication, Vol. 21, PWN Polish Scientific Publishers, Warsaw 1988 pp. 503\u2013512 (in Russian), extended version in English accepted for publication in Theoretical Computer Science."},{"key":"25_CR19","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/0022-0000(84)90069-2","volume":"28","author":"C.H. Papadimitriou","year":"1984","unstructured":"PAPADIMITRIOU, C.H. \u2014 SIPSER, M.: Communication complexity. J. Comp. Syst. Sci., Vol. 28, 1984, pp. 260\u2013269.","journal-title":"J. Comp. Syst. Sci."},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"THOMPSON,C.D.: Area-time complexity for VLSI. In: Proc. 11th Annual ACM STOC, ACM 1979, pp. 81\u201388.","DOI":"10.1145\/800135.804401"},{"key":"25_CR21","doi-asserted-by":"crossref","unstructured":"WEGENER,I.: The Complexity of Boolean Functions. John Wiley & Sons and B. G. Teubner 1987.","DOI":"10.1007\/3-540-18170-9_185"}],"container-title":["Lecture Notes in Computer Science","Aspects and Prospects of Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-53414-8_51.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:49:58Z","timestamp":1605628198000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-53414-8_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540534143","9783540468691"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-53414-8_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}