Abstract
We describe a method for relating the complexity of random finite functions to the complexity of the most complex finite functions. Using this method we derive an alternative proof for a known Ω( n log n) lower bound on the depth of noisy Boolean decision trees that compute random functions.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
