{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:58:28Z","timestamp":1725551908355},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540311980"},{"type":"electronic","value":"9783540322177"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11611257_13","type":"book-chapter","created":{"date-parts":[[2006,1,5]],"date-time":"2006-01-05T16:37:18Z","timestamp":1136479038000},"page":"158-165","source":"Crossref","is-referenced-by-count":1,"title":["Non-intersecting Complexity"],"prefix":"10.1007","author":[{"given":"Aleksandrs","family":"Belovs","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","first-page":"13","volume":"673","author":"A. Belovs","year":"2004","unstructured":"Belovs, A.: A Way of constructing Functions with a Low Polynomial Degree. Scientific papers University of Latvia\u00a0673, 13\u201317 (2004)","journal-title":"Scientific papers University of Latvia"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0304-3975(01)00144-X","volume":"288","author":"H. Burhman","year":"2001","unstructured":"Burhman, H., de Wolf, R.: Complexity Measures and Decision Tree Complexity: a\u00a0Survey. Theoretical Computer Science\u00a0288, 21\u201343 (2001)","journal-title":"Theoretical Computer Science"},{"key":"13_CR3","first-page":"439","volume-title":"Quantum Computing","author":"J. Gruska","year":"1999","unstructured":"Gruska, J.: Quantum Computing, p. 439. McGraw Hill, London (1999)"},{"key":"13_CR4","unstructured":"Midrij\u0101nis, G.: On Randomized and Quantum Query Complexities, Unpublished \n                    \n                      http:\/\/arxiv.org\/abs\/quant-ph\/0501142"},{"key":"13_CR5","volume-title":"Perceptrons","author":"M. Minsky","year":"1988","unstructured":"Minsky, M., Papert, S.: Perceptrons. MIT Press, Cambridge (1988)"},{"key":"13_CR6","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1007\/BF01192527","volume":"15","author":"N. Nisan","year":"1995","unstructured":"Nisan, N., Wigderson, A.: On Rank vs. Communication Complexity. Combinatorica\u00a015, 557\u2013565 (1995)","journal-title":"Communication Complexity. Combinatorica"},{"key":"13_CR7","first-page":"500","volume-title":"Computational Complexity","author":"C. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.: Computational Complexity, p. 500. Addison-Wesley, Reading (1994)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2006: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11611257_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:09:21Z","timestamp":1619507361000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11611257_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540311980","9783540322177"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/11611257_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}