Proving lower bounds for linear decision trees

Marc Snir

doi:10.1007/3-540-10843-2_25

Proving lower bounds for linear decision trees

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Original language	English (US)
Title of host publication	Automata, Languages and Programming - 8th Colloquium
Editors	Shimon Even, Oded Kariv
Publisher	Springer
Pages	305-315
Number of pages	11
ISBN (Print)	9783540108436
DOIs	https://doi.org/10.1007/3-540-10843-2_25
State	Published - 1981
Externally published	Yes
Event	8th International Colloquium on Automata, Languages and Programming, ICALP 1981 - Acre, Israel Duration: Jul 13 1981 → Jul 17 1981

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	115 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	8th International Colloquium on Automata, Languages and Programming, ICALP 1981
Country/Territory	Israel
City	Acre
Period	7/13/81 → 7/17/81

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/3-540-10843-2_25

Cite this

Proving lower bounds for linear decision trees. / Snir, Marc.

Automata, Languages and Programming - 8th Colloquium. ed. / Shimon Even; Oded Kariv. Springer, 1981. p. 305-315 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 115 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Snir, M 1981, Proving lower bounds for linear decision trees. in S Even & O Kariv (eds), Automata, Languages and Programming - 8th Colloquium. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 115 LNCS, Springer, pp. 305-315, 8th International Colloquium on Automata, Languages and Programming, ICALP 1981, Acre, Israel, 7/13/81. https://doi.org/10.1007/3-540-10843-2_25

@inproceedings{5e395d0dddfa449790828b558947a8de,

title = "Proving lower bounds for linear decision trees",

author = "Marc Snir",

note = "Copyright: Copyright 2017 Elsevier B.V., All rights reserved.; 8th International Colloquium on Automata, Languages and Programming, ICALP 1981 ; Conference date: 13-07-1981 Through 17-07-1981",

year = "1981",

doi = "10.1007/3-540-10843-2_25",

language = "English (US)",

isbn = "9783540108436",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer",

pages = "305--315",

editor = "Shimon Even and Oded Kariv",

booktitle = "Automata, Languages and Programming - 8th Colloquium",

address = "Germany",

}

TY - GEN

T1 - Proving lower bounds for linear decision trees

AU - Snir, Marc

PY - 1981

Y1 - 1981

UR - http://www.scopus.com/inward/record.url?scp=85030870212&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85030870212&partnerID=8YFLogxK

U2 - 10.1007/3-540-10843-2_25

DO - 10.1007/3-540-10843-2_25

M3 - Conference contribution

AN - SCOPUS:85030870212

SN - 9783540108436

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 305

EP - 315

BT - Automata, Languages and Programming - 8th Colloquium

A2 - Even, Shimon

A2 - Kariv, Oded

PB - Springer

T2 - 8th International Colloquium on Automata, Languages and Programming, ICALP 1981

Y2 - 13 July 1981 through 17 July 1981

ER -

Proving lower bounds for linear decision trees

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other links

Cite this