[{"language":[{"iso":"eng"}],"_id":"16564","department":[{"_id":"63"}],"user_id":"15415","status":"public","publication":"computational complexity","type":"journal_article","title":"A lower bound for randomized algebraic decision trees","doi":"10.1007/bf01270387","date_updated":"2022-01-06T06:52:52Z","date_created":"2020-04-15T10:42:43Z","author":[{"first_name":"Dima","last_name":"Grigoriev","full_name":"Grigoriev, Dima"},{"first_name":"Marek","last_name":"Karpinski","full_name":"Karpinski, Marek"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"first_name":"Roman","last_name":"Smolensky","full_name":"Smolensky, Roman"}],"year":"1997","page":"357-375","citation":{"apa":"Grigoriev, D., Karpinski, M., Meyer auf der Heide, F., &#38; Smolensky, R. (1997). A lower bound for randomized algebraic decision trees. <i>Computational Complexity</i>, 357–375. <a href=\"https://doi.org/10.1007/bf01270387\">https://doi.org/10.1007/bf01270387</a>","short":"D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, R. Smolensky, Computational Complexity (1997) 357–375.","bibtex":"@article{Grigoriev_Karpinski_Meyer auf der Heide_Smolensky_1997, title={A lower bound for randomized algebraic decision trees}, DOI={<a href=\"https://doi.org/10.1007/bf01270387\">10.1007/bf01270387</a>}, journal={computational complexity}, author={Grigoriev, Dima and Karpinski, Marek and Meyer auf der Heide, Friedhelm and Smolensky, Roman}, year={1997}, pages={357–375} }","mla":"Grigoriev, Dima, et al. “A Lower Bound for Randomized Algebraic Decision Trees.” <i>Computational Complexity</i>, 1997, pp. 357–75, doi:<a href=\"https://doi.org/10.1007/bf01270387\">10.1007/bf01270387</a>.","ama":"Grigoriev D, Karpinski M, Meyer auf der Heide F, Smolensky R. A lower bound for randomized algebraic decision trees. <i>computational complexity</i>. 1997:357-375. doi:<a href=\"https://doi.org/10.1007/bf01270387\">10.1007/bf01270387</a>","chicago":"Grigoriev, Dima, Marek Karpinski, Friedhelm Meyer auf der Heide, and Roman Smolensky. “A Lower Bound for Randomized Algebraic Decision Trees.” <i>Computational Complexity</i>, 1997, 357–75. <a href=\"https://doi.org/10.1007/bf01270387\">https://doi.org/10.1007/bf01270387</a>.","ieee":"D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, and R. Smolensky, “A lower bound for randomized algebraic decision trees,” <i>computational complexity</i>, pp. 357–375, 1997."},"publication_identifier":{"issn":["1016-3328","1420-8954"]},"publication_status":"published"}]