Skip to main content
Avi Wigderson
Personal
Short Bio
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
Probabilistic Boolean Decision Trees and the Complexity of Evaluating Game Trees
Submitted by
smcneil
on Mon, 2012-01-16 00:00
Author:
M. Saks
A. Wigderson
Publication:
Proceedings of the 27th Foundations of Computer Science, pp. 29-38, October 1986.
Year:
1986
Abstract:
http://www.math.ias.edu/~avi/PUBLICATIONS/ABSTRACT/sw86.pdf
Hide
Files
File:
Proceedings version (pdf)
Proceedings version (ps)
‹ Planarity of Edge Ordered Graphs
up
Probabilistic Communication Complexity of Boolean Relations ›