{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:22:52Z","timestamp":1725488572833},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424871"},{"type":"electronic","value":"9783540446699"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44669-9_7","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T10:32:26Z","timestamp":1186741946000},"page":"47-58","source":"Crossref","is-referenced-by-count":0,"title":["A Discrete Approximation and Communication Complexity Approach to the Superposition Problem"],"prefix":"10.1007","author":[{"given":"Farid","family":"Ablayev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Svetlana","family":"Ablayeva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"key":"7_CR1","unstructured":"F. Ablayev, Communication method of the analyses of superposition of continuous functions, in Proceedings of the international conference \u201dAlgebra and Analyses part II. Kazan, 1994, 5\u20137 (in Russian). See also F. Ablayev, Communication complexity of probabilistic computations and some its applications, Thesis of doctor of science dissertation, Moscow State University, 1995, (in Russian)."},{"issue":"4","key":"7_CR2","first-page":"679","volume":"114","author":"V. Arnold","year":"1957","unstructured":"V. Arnold, On functions of Three Variables, Dokladi Akademii Nauk, 114,4, (1957), 679\u2013681.","journal-title":"Dokladi Akademii Nauk"},{"key":"7_CR3","first-page":"253","volume":"3","author":"D. Hilbert","year":"1900","unstructured":"D. Hilbert, Mathematische Probleme, Nachr. Akad. Wiss. Gottingen (1900) 253\u2013297; Gesammelete Abhandlungen, Bd. 3 (1935), 290\u2013329.","journal-title":"Nachr. Akad. Wiss."},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"J. Hromkovic, Communication Complexity and Parallel Computing, EATCS Series, Springer-Verlag, (1997).","DOI":"10.1007\/978-3-662-03442-2"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BF01206317","volume":"5","author":"M. Karchmer","year":"1995","unstructured":"M. Karchmer, R. Raz, and A. Wigderson, Super-logarithmic Depth Lower Bounds Via the Direct Sum in Communication Complexity, Computational Complexity, 5, (1995), 191\u2013204.","journal-title":"Computational Complexity"},{"issue":"5","key":"7_CR6","first-page":"953","volume":"114","author":"A. Kolmogorov","year":"1957","unstructured":"A. Kolmogorov, On Representation of Continuous Functions of Several Variables by a superposition of Continuous Functions of one Variable and Sum Operation. Dokladi Akademii Nauk, 114,5, (1957), 953\u2013956.","journal-title":"Dokladi Akademii Nauk"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"E. Kushilevitz and N. Nisan, Communication complexity, Cambridge University Press, (1997).","DOI":"10.1017\/CBO9780511574948"},{"issue":"6","key":"7_CR8","doi-asserted-by":"publisher","first-page":"469","DOI":"10.2307\/2311185","volume":"69","author":"G. Lorenz","year":"1962","unstructured":"G. Lorenz, Metric Entropy, Widths and Superpositions Functions, Amer. Math. Monthly 69,6, (1962), 469\u2013485.","journal-title":"Amer. Math. Monthly"},{"key":"7_CR9","first-page":"5","volume":"37","author":"S. Marchenkov","year":"1980","unstructured":"S. Marchenkov, On One Method of Analysis of superpositions of Continuous Functions, Problemi Kibernetici, 37, (1980), 5\u201317.","journal-title":"Problemi Kibernetici"},{"key":"7_CR10","first-page":"255","volume":"23","author":"A. Vitushkin","year":"1977","unstructured":"A. Vitushkin, On Representation of Functions by Means of Superpositions and Related Topics, L\u2019Enseignement mathematique, 23, fasc.3\u20134, (1977), 255\u2013320.","journal-title":"L\u2019Enseignement mathematique"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"A. C. Yao, Some Complexity Questions Related to Distributive Computing, in Proc. of the 11th Annual ACM Symposium on the Theory of Computing, (1979), 209\u2013213.","DOI":"10.1145\/800135.804414"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44669-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T22:12:52Z","timestamp":1556748772000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44669-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424871","9783540446699"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-44669-9_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}