Equivalence of binary and ternary algebraic decision trees

DOI10.1007/PL00009169zbMATH Open0878.68064OpenAlexW2063051138MaRDI QIDQ1364419FDOQ1364419

Robert Beals

Publication date: 4 September 1997

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009169

zbMATH Keywords

algebraic decision trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

This page was built for publication: Equivalence of binary and ternary algebraic decision trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1364419)