Algebraic decision trees and Euler characteristics

DOI10.1016/0304-3975(94)00082-TzbMath0873.68149OpenAlexW2134734683MaRDI QIDQ673780

Andrew Chi-Chih Yao

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)00082-t

zbMATH Keywords

algebraic computation tree

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

Rough analysis of computation trees ⋮ Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets ⋮ Decision tree complexity and Betti numbers

Cites Work

• Lower bounds for the non-linear complexity of algebraic computation trees with integer inputs
• A lower bound for the integer element distinctness problem
• The Computational Complexity of Continued Fractions
• On the Polyhedral Decision Problem
• Lower bounds for algebraic decision trees
• Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains
• On Analytical Complexes
• Pontryagin Duality in K-Theory
• On the Betti Numbers of Real Varieties
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algebraic decision trees and Euler characteristics