Abstract
We prove a tight lower bound of Ω(log log n) in the parallel decision tree model, on the complexity of searching the d-dimensional cube of side n using n d−1 processors. The lower bound is valid even for randomized algorithms which err with constant probability.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.