On Directional vs. Undirectional Randomized Decision Tree Complexity for Read-Once Formulas

Kazuyuki Amano. On Directional vs. Undirectional Randomized Decision Tree Complexity for Read-Once Formulas. In Taso Viglas, Alex Potanin, editors, Theory of Computing 2010, CATS 2010, Brisbane, Australia, January 2010. Volume 109 of CRPIT, pages 25-30, Australian Computer Society, 2010. [doi]

@inproceedings{Amano10-2,
  title = {On Directional vs. Undirectional Randomized Decision Tree Complexity for Read-Once Formulas},
  author = {Kazuyuki Amano},
  year = {2010},
  url = {http://crpit.com/abstracts/CRPITV109Amano.html},
  researchr = {https://researchr.org/publication/Amano10-2},
  cites = {0},
  citedby = {0},
  pages = {25-30},
  booktitle = {Theory of Computing 2010, CATS 2010, Brisbane, Australia, January 2010},
  editor = {Taso Viglas and Alex Potanin},
  volume = {109},
  series = {CRPIT},
  publisher = {Australian Computer Society},
  isbn = {978-1-920682-90-3},
}