An Exponential Lower Bound on the Size of Algebraic Decision Trees for MAX - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Computational Complexity Année : 1998

An Exponential Lower Bound on the Size of Algebraic Decision Trees for MAX

D Grigoriev
  • Fonction : Auteur
  • PersonId : 990287
M Karpinski
  • Fonction : Auteur
A C Yao
  • Fonction : Auteur
  • PersonId : 1085164

Résumé

We prove an exponential lower bound on the size of any xed-degree algebraic decision tree for solving MAX, the problem of nding the maximum of n real numbers. This complements the n 1 lower bound of Rabin R72] on the depth of algebraic decision trees for this problem. The proof in fact gives an exponential lower bound on size for the polyhedral decision problem MAX= of testing whether the j-th number is the maximum among a list of n real numbers. Previously, except for linear decision trees, no nontrivial lower bounds on the size of algebraic decision trees for any familiar problems are known. We also establish an interesting connection between our lower bound and the maximum number of minimal cutsets for any rank-d hypergraphs on n vertices.
Fichier principal
Vignette du fichier
max[1].pdf (176.35 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03049461 , version 1 (09-12-2020)

Identifiants

  • HAL Id : hal-03049461 , version 1

Citer

D Grigoriev, M Karpinski, A C Yao. An Exponential Lower Bound on the Size of Algebraic Decision Trees for MAX. Computational Complexity, 1998. ⟨hal-03049461⟩

Collections

CNRS
11 Consultations
60 Téléchargements

Partager

Gmail Facebook X LinkedIn More