Decision trees: Old and new results.
type: Item
instance of: scholarly article
title: Decision trees: Old and new results.
zbMATH Open document ID: 1045.68983
author: Rudolf Fleischer
published in: Information and Computation
publication date: 2003-01-14T00:00:00Z
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1853052
zbMATH Keywords: mlf-functions
MaRDI profile type: Publication
full work available at URL: inco.1999.2788
OpenAlex ID: W2093331391
cites work: Minimal generation of basic open semianalytic sets
cites work: Minimale Erzeugung von Positivbereichen
cites work: On the complexity of computations under varying sets of primitives
cites work: Q3772828
cites work: A Counting Approach to Lower Bounds for Selection Problems
cites work: On selecting the \(k\) largest with restricted quadratic queries
cites work: Q4228517
cites work: Q3926035
cites work: The complexity of problems on probabilistic, nondeterministic, and alternating decision trees
cites work: A Polynomial Linear Search Algorithm for the n -Dimensional Knapsack Problem
cites work: Simulating probabilistic by deterministic algebraic computation trees
cites work: A note on Rabin's width of a complete proof
cites work: Applications of Ramsey's theorem to decision tree complexity
cites work: A tight lower bound for the complexity of path-planning for a disc
cites work: Proving simultaneous positivity of linear forms
cites work: Obtaining lower bounds using artificial components
cites work: Rabin's width of a complete proof and the width of a semialgebraic set
cites work: On the Optimality of Some Set Algorithms
cites work: On the Polyhedral Decision Problem
cites work: Comparisons between linear functions can help
cites work: Lower bounds on probabilistic linear decision trees
cites work: Lower bounds for algebraic decision trees
cites work: The Computational Complexity of Continued Fractions
cites work: On selecting the k largest with median tests
cites work: Q4230349
DOI: 10.1006/INCO.1999.2788
description: scientific article; zbMATH DE number 1853052