Abstract
We prove that evaluating a Boolean decision tree of height h requires Ω(h/log* h) time on any EREW PRAM with communication width one. Since this function can be easily solved in time O(√h) on a CREW PRAM with communication width one, this gives a separation between the two models. Our result can be extended to show a separation whenever the EREW PRAM has communication width m ε o(√h).
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
