On Centralized Sublinear Algorithms and Some Relations to Distributed Computing
Dana Ron TelAviv University ADGA October 2015 Efficient Centralized Algorithms Usually when we say that an algorithm is efficient we mean that it runs in time polynomial in the input size
Embed this Presentation
Available Downloads
Download Notice
Download Presentation The PPT/PDF document "On Centralized Sublinear Algorithms and ..." is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.