{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:08:56Z","timestamp":1725548936929},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540249986"},{"type":"electronic","value":"9783540318569"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31856-9_49","type":"book-chapter","created":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T13:06:19Z","timestamp":1267535179000},"page":"593-604","source":"Crossref","is-referenced-by-count":5,"title":["Robust Polynomials and Quantum Algorithms"],"prefix":"10.1007","author":[{"given":"Harry","family":"Buhrman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilan","family":"Newman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hein","family":"R\u00f6hrig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ronald","family":"de Wolf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"49_CR1","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1145\/502090.502097","volume":"48","author":"R. Beals","year":"2001","unstructured":"Beals, R., Buhrman, H., Cleve, R., Mosca, M., de Wolf, R.: Quantum lower bounds by polynomials. Journal of the ACM\u00a048(4), 778\u2013797 (2001); Earlier version in FOCS 1998","journal-title":"Journal of the ACM"},{"issue":"1","key":"49_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0304-3975(01)00144-X","volume":"288","author":"H. Buhrman","year":"2002","unstructured":"Buhrman, H., de Wolf, R.: Complexity measures and decision tree complexity: A survey. Theoretical Computer Science\u00a0288(1), 21\u201343 (2002)","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"49_CR3","doi-asserted-by":"publisher","first-page":"1001","DOI":"10.1137\/S0097539791195877","volume":"23","author":"U. Feige","year":"1994","unstructured":"Feige, U., Raghavan, P., Peleg, D., Upfal, E.: Computing with noisy information. SIAM Journal on Computing\u00a023(5), 1001\u20131018 (1994)","journal-title":"SIAM Journal on Computing"},{"doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of 28th ACM STOC, pp. 212\u2013219 (1996)","key":"49_CR4","DOI":"10.1145\/237814.237866"},{"key":"49_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/3-540-45061-0_25","volume-title":"Automata, Languages and Programming","author":"P. H\u00f8yer","year":"2003","unstructured":"H\u00f8yer, P., Mosca, M., de Wolf, R.: Quantum search on bounded-error inputs. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 291\u2013299. Springer, Heidelberg (2003)"},{"unstructured":"Iwama, K., Putra, R., Yamashita, S.: Quantum query complexity of biased oracles. Unpublished manuscript and talk at EQIS Conference (September 2003)","key":"49_CR6"},{"key":"49_CR7","volume-title":"Communication Complexity","author":"E. Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)"},{"key":"49_CR8","doi-asserted-by":"publisher","first-page":"42305","DOI":"10.1103\/PhysRevA.61.042305","volume":"61","author":"G.L. Long","year":"2000","unstructured":"Long, G.L., Li, Y.S., Zhang, W.L., Tu, C.C.: Dominant gate imperfection in Grover\u2019s quantum search algorithm. Physical Review A\u00a061, 042305 (2000)","journal-title":"Physical Review A"},{"issue":"4","key":"49_CR9","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF01263419","volume":"4","author":"N. Nisan","year":"1994","unstructured":"Nisan, N., Szegedy, M.: On the degree of Boolean functions as real polynomials. Computational Complexity\u00a04(4), 301\u2013313 (1994); Earlier version in STOC 1992","journal-title":"Computational Complexity"},{"key":"49_CR10","doi-asserted-by":"publisher","first-page":"52313","DOI":"10.1103\/PhysRevA.68.052313","volume":"68","author":"N. Shenvi","year":"2003","unstructured":"Shenvi, N., Brown, K.R., Whaley, K.B.: Effects of a random noisy oracle on search algorithm complexity. Physical Review A\u00a068, 052313 (2003)","journal-title":"Physical Review A"},{"key":"49_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/3-540-45995-2_47","volume-title":"LATIN 2002: Theoretical Informatics","author":"M. Szegedy","year":"2002","unstructured":"Szegedy, M., Chen, X.: Computing Boolean functions from multiple faulty copies of input bits. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol.\u00a02286, pp. 539\u2013553. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","STACS 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31856-9_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T11:21:25Z","timestamp":1552389685000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31856-9_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540249986","9783540318569"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31856-9_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}