{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T19:44:27Z","timestamp":1649187867893},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1996,12,1]],"date-time":"1996-12-01T00:00:00Z","timestamp":849398400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Complexity"],"published-print":{"date-parts":[[1996,12]]},"DOI":"10.1007\/bf01270388","type":"journal-article","created":{"date-parts":[[2005,3,24]],"date-time":"2005-03-24T04:42:18Z","timestamp":1111639338000},"page":"376-388","source":"Crossref","is-referenced-by-count":3,"title":["Randomization and the computational power of analytic and algebraic decision trees"],"prefix":"10.1007","volume":"6","author":[{"given":"Dima","family":"Grigoriev","sequence":"first","affiliation":[]},{"given":"Marek","family":"Karpinski","sequence":"additional","affiliation":[]},{"given":"Roman","family":"Smolensky","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"M. Ben-Or,Lower Bounds for Algebraic Computation Trees, Proc. 15th ACM STOC (1983), pp. 80?86.","DOI":"10.1145\/800061.808735"},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"A. Bj\u00f6rner, L. Lovasz and A. Yao,Linear Decision Trees: Volume Estimates and Topological Bounds, Proc. ACM STOC (1992), pp. 170?177.","DOI":"10.1145\/129712.129730"},{"key":"CR3","unstructured":"J. Bruck and R. Smolensky,Polynomial Threshold Functions, AC 0 Functions and Spectral Norms., Proc. IEEE FOCS (1990), pp. 632?641."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1006\/jcom.1993.1016","volume":"9","author":"P. Buergisser","year":"1993","unstructured":"P. Buergisser, M. Karpinski andT. Lickteig,On Randomized Algebraic Test Complexity, J. of Complexity9 (1993), pp. 231?251.","journal-title":"J. of Complexity"},{"key":"CR5","unstructured":"H. Cartan,Elementary Theory of Analytic Functions of One or Several Complex Variables, Addison-Wesley (1963)."},{"key":"CR6","unstructured":"R. Courant,Theory of Functions of a Complex Variable, New York University Press (1948)."},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"H. Edelsbrunner,Algorithms in Computational Geometry, Springer-Verlag, 1987.","DOI":"10.1007\/978-3-642-61568-9"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"R. Fleischer,Decision Trees: Old and New Results, Proc. ACM STOC (1993), pp. 468?477.","DOI":"10.1145\/167088.167216"},{"key":"CR9","series-title":"Technical Report TR-93-042","volume-title":"Lower Bounds on Complexity of Testing Membership to a Polygon for Algebraic and Randomized Computation Trees","author":"D. Grigoriev","year":"1993","unstructured":"D. Grigoriev andM. Karpinski,Lower Bounds on Complexity of Testing Membership to a Polygon for Algebraic and Randomized Computation Trees Technical Report TR-93-042, International Computer Science Institute, Berkeley, 1993."},{"key":"CR10","unstructured":"D. Grigoriev, M. Karpinski, F. Meyer auf der Heide and R. Smolensky,A Lower Bound for Randomized Algebraic Decision Trees, Computational Complexity 6 (1996\/1997) (this volume), pp. 357?375. Extended Abstract in Proc. 28th ACM STOC (1996), pp. 612?619."},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"D. Grigoriev, M. Karpinski and N. Vorobjov,Improved Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision Trees, Proc. IEEE FOCS (1995), pp. 258?265.","DOI":"10.1109\/SFCS.1995.492481"},{"key":"CR12","series-title":"Technical Report TR-95-066","volume-title":"An Exponential Lower Bound on the Size of Algebraic Decision Trees for MAX","author":"D. Grigoriev","year":"1995","unstructured":"D. Grigoriev, M. Karpinski andA. Yao,An Exponential Lower Bound on the Size of Algebraic Decision Trees for MAX Technical Report TR-95-066, International Computer Science Institute, Berkeley (1995); to appear in computational complexity."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/S0747-7171(88)80005-1","volume":"5","author":"D. Grigoriev","year":"1988","unstructured":"D. Grigoriev andN. Vorobjov,Solving Systems of Polynomial Inequalities in Subexponential Time, Journal of Symbolic Comp.,5 (1988), pp. 37?64.","journal-title":"Journal of Symbolic Comp."},{"key":"CR14","doi-asserted-by":"crossref","unstructured":"D. Grigoriev and N. Vorobjov,Complexity Lower Bounds for Computation Trees with Elementary Transcendental Function Gates, Proc. IEEE FOCS (1994), pp. 548?552.","DOI":"10.1109\/SFCS.1994.365736"},{"key":"CR15","doi-asserted-by":"crossref","unstructured":"J.W. Jaromczyk,Lower Bound for Problems Defined by Polynomial Inequalities, Proc. Symp. on Foundations Computation Theory (1981), LNCS, Vol. 117, Springer-Verlag (1981), pp. 165?172.","DOI":"10.1007\/3-540-10854-8_17"},{"key":"CR16","doi-asserted-by":"crossref","unstructured":"E. Kushilevitz and Y. Mansour,Learning Decision Trees Using the Fourier Spectrum, Proc. ACM STOC (1991), pp. 455?464.","DOI":"10.1145\/103418.103466"},{"key":"CR17","volume-title":"Algebra","author":"S. Lang","year":"1984","unstructured":"S. Lang,Algebra, Addison-Wesley, New York (1984)."},{"key":"CR18","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1145\/3828.3838","volume":"32","author":"U. Manber","year":"1985","unstructured":"U. Manber andM. Tompa,Probabilistic, Nondeterministic and Alternating Decision Trees, J. ACM, Vol. 32 (1985), pp. 720?732.","journal-title":"J. ACM"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0304-3975(85)90079-9","volume":"41","author":"F. Meyer Heide auf der","year":"1985","unstructured":"F. Meyer auf der Heide,Simulating Probabilistic by Deterministic Algebraic Computation Trees, Theoretical Computer Science41 (1985), pp. 325?330.","journal-title":"Theoretical Computer Science"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1007\/BF01205053","volume":"4","author":"L. Monta\u00f1a","year":"1994","unstructured":"L. Monta\u00f1a, L. Pardo andT. Recio,A Note on Rabin's Width of a Complete Proof, computational complexity4 (1994), pp. 12?36.","journal-title":"computational complexity"},{"key":"CR21","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1016\/S0022-0000(72)80034-5","volume":"6","author":"M. Rabin","year":"1972","unstructured":"M. Rabin,Proving Simultaneous Positivity of Linear Forms, J. Comput. Syst. Sci.6 (1972), pp. 639?650.","journal-title":"J. Comput. Syst. Sci."},{"key":"CR22","doi-asserted-by":"crossref","unstructured":"R. Smolensky,Algebraic Methods in the Theory of Lower Bounds for Boolean Circuit Complexity, Proc. ACM STOC (1987), pp. 77?82.","DOI":"10.1145\/28395.28404"},{"key":"CR23","doi-asserted-by":"crossref","unstructured":"A. Tarski,A Decision Method for Elementary Algebra and Geometry, University of California Press, 1951.","DOI":"10.1525\/9780520348097"},{"key":"CR24","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0020-0190(94)90052-3","volume":"49","author":"H. Ting","year":"1994","unstructured":"H. Ting andA. Yao,A Randomized Algorithm for Finding Maximum with O(log 2 n) Polynomial Tests Inform. Processing Letters49 (1994), pp. 39?43.","journal-title":"Inform. Processing Letters"},{"key":"CR25","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(86)90135-0","volume":"47","author":"L. Valiant","year":"1986","unstructured":"L. Valiant andV. Vazirani,NP is as Easy as Detecting Unique Solutions, Theor. Comp. Sci.47 (1986), pp. 85?93.","journal-title":"Theor. Comp. Sci."},{"key":"CR26","unstructured":"A. Yao,Algebraic Decision Trees and Euler Characteristics, Proc. 33rd IEEE FOCS (1992), pp. 268?277."},{"key":"CR27","unstructured":"A. Yao,Decision Tree Complexity and Betti Numbers Proc. 26th ACM STOC (1994), pp. 615?624."}],"container-title":["Computational Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01270388.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01270388\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01270388","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,7]],"date-time":"2021-07-07T06:07:02Z","timestamp":1625638022000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01270388"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,12]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1996,12]]}},"alternative-id":["BF01270388"],"URL":"https:\/\/doi.org\/10.1007\/bf01270388","relation":{},"ISSN":["1016-3328","1420-8954"],"issn-type":[{"value":"1016-3328","type":"print"},{"value":"1420-8954","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,12]]}}}