Skip to main content
Avi Wigderson
Personal
CV
Short CV
Contact
Interviews & More
Works
Book: Math and Computation
Publications
Talks
Surveys
Efficient Universe
Post-Docs
Students
CSDM
Seminars
Conferences & videos
Optimization, Complexity and Invariant Theory
Avi60
Lens of Computation on the Sciences
Pseudorandomness
You are here
Home
»
Avi Wigderson
»
Publications
Randomized vs. Deterministic Decision Tree Complexity for Read--Once Boolean Functions
Submitted by
smcneil
on Mon, 2012-01-16 00:00
Author:
R. Heiman
A. Wigderson
Publication:
Complexity Theory, vol. 1, pp. 311-329, 1991.
Year:
1991
Abstract:
http://www.math.ias.edu/~avi/PUBLICATIONS/ABSTRACT/hw91.pdf
Files
File:
Journal version (pdf)
Journal version (ps)
‹ Quantum vs. Classical Communication and Computation
up
Randomized vs. Deterministic Decision Tree Complexity for Read--Once Boolean Functions ›