Lower bounds for algebraic decision trees

1982/03/01 by John Steele, J Michael Steele, Andrew Chi-Chih Yao +1 · 3 citations
Computer Science · Engineering · #Advanced Graph Theory Research #VLSI and Analog Circuit Testing #VLSI and FPGA Design Techniques

paper · doi:10.1016/0196-6774(82)90002-5

crossref issued 1982/03/01 · crossref published 1982/03/01 · crossref published-print 1982/03/01 · openalex publication_date 1982/03/01 · crossref created 2005/02/10 · crossref deposited 2019/01/29 · openalex created_date 2025/10/10 · crossref indexed 2026/04/20 · openalex updated_date 2026/06/26

Cited by

• Complexity theory and numerical analysis
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Decision tree model [wikipedia]