Decision trees with Boolean threshold queries

DOI10.1006/jcss.1995.1085zbMath0839.68075OpenAlexW2006573851MaRDI QIDQ1908341

Ilan Newman, Yosi Ben-Asher

Publication date: 19 March 1996

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1995.1085

zbMATH Keywords

decision trees

Mathematics Subject Classification ID

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

Related Items (7)

On the Decision Tree Complexity of Threshold Functions ⋮ Geometric approach for optimal routing on a mesh with buses ⋮ On (simple) decision tree rank ⋮ Optimal direct sum results for deterministic and randomized decision tree complexity ⋮ Secure and highly-available aggregation queries in large-scale sensor networks via set sampling ⋮ Unnamed Item ⋮ On the decision tree complexity of threshold functions

This page was built for publication: Decision trees with Boolean threshold queries