Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
 
 
DownloadE-Mail
 Lokale TagsFreigabegeschichteDetailsÜbersicht
  Decision trees: old and new results

Fleischer, R. (1999). Decision trees: old and new results. Information and Computation, 152, 44-61.

Item is

 

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:
Datensatz-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-35B6-3 Versions-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-35B7-1
Genre: Zeitschriftenartikel

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Fleischer, Rudolf1, Autor           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: In this paper, we prove two general lower bounds for algebraic decision trees which test membership in a set $S\subseteq R^n$ which is defined by linear inequalities. Let $rank(S)$ be the maximal dimension of a linear subspace contained in the closure of $S$ {in the Euclidean topology}. First we show that any decision tree for $S$ which uses products of linear functions (we call such functions {\em mlf-functions}) must have depth at least $n-rank(S)$. This solves an open question raised by A.C.~Yao and can be used to show that mlf-functions are not really more powerful than simple comparisons between the input variables when computing the largest $k$ out of $n$ elements. Yao proved this result in the special case when products of at most two linear functions are allowed. Out proof also shows that any decision tree for this problem must have exponential size. Using the same methods, we can give an alternative proof of Rabin's Theorem, namely that the depth of any decision tree for $S$ using arbitrary analytic functions is at least $n-rank(S)$.

Details

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 2010-03-021999
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: -
 Inhaltsverzeichnis: -
 Art der Begutachtung: Expertenbegutachtung
 Identifikatoren: eDoc: 518057
Anderer: Local-ID: C1256428004B93B8-E642D8CAA242B736C12568AA0077E514-Fleischer_dectrees_1999
 Art des Abschluß: -

Veranstaltung

einblenden:

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: Information and Computation
Genre der Quelle: Zeitschrift
 Urheber:
Affiliations:
Ort, Verlag, Ausgabe: -
Seiten: - Band / Heft: 152 Artikelnummer: - Start- / Endseite: 44 - 61 Identifikator: -