Abstract
A special class non uniform recurrent equations produced data dependency graphs which involve non-constant data dependencies on the input data f(i) is considered. The mathematical expectation of the execution time for the problems described by such recurrences under the assumption that f(i) are uniformly distributed is found. In case when f(i) are exponentially distributed it is proved that the mathematical expectation of time tends to the optimal one.
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.
