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