Proving lower bounds for linear decision trees

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Original languageEnglish (US)
Title of host publicationAutomata, Languages and Programming - 8th Colloquium
EditorsShimon Even, Oded Kariv
PublisherSpringer-Verlag
Pages305-315
Number of pages11
ISBN (Print)9783540108436
DOIs
StatePublished - Jan 1 1981
Externally publishedYes
Event8th International Colloquium on Automata, Languages and Programming, ICALP 1981 - Acre, Israel
Duration: Jul 13 1981Jul 17 1981

Publication series

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

Other

Other8th International Colloquium on Automata, Languages and Programming, ICALP 1981
CountryIsrael
CityAcre
Period7/13/817/17/81

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Snir, M. (1981). Proving lower bounds for linear decision trees. In S. Even, & O. Kariv (Eds.), Automata, Languages and Programming - 8th Colloquium (pp. 305-315). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 115 LNCS). Springer-Verlag. https://doi.org/10.1007/3-540-10843-2_25