Complexity of Decision Trees for Boolean Functions

Rusins Freivalds, Masahiro Miyakawa, Ivo G. Rosenberg. Complexity of Decision Trees for Boolean Functions. In 33rd IEEE International Symposium on Multiple-Valued Logic (ISMVL 2003), 16-19 May 2003, Tokyo, Japan. pages 253, IEEE Computer Society, 2003. [doi]

@inproceedings{FreivaldsMR03,
  title = {Complexity of Decision Trees for Boolean Functions},
  author = {Rusins Freivalds and Masahiro Miyakawa and Ivo G. Rosenberg},
  year = {2003},
  doi = {http://computer.org/proceedings/ismvl/1918/19180253abs.htm},
  researchr = {http://researchr.org/publication/FreivaldsMR03},
  cites = {0},
  citedby = {0},
  pages = {253},
  booktitle = {33rd IEEE International Symposium on Multiple-Valued Logic (ISMVL 2003), 16-19 May 2003, Tokyo, Japan},
  publisher = {IEEE Computer Society},
  isbn = {0-7695-1918-0},
}