In computational complexity theory, the potential method is a method used to analyze the amortized time and space complexity of a data structure, a measure of its performance over sequences of operations that smooths out the cost of infrequent but expensive operations.
Read more about Potential Method: Definition of Amortized Time, Relation Between Amortized and Actual Time, Amortized Analysis of Worst-case Inputs, Example, Applications
Famous quotes containing the words potential and/or method:
“Children are potentially free and their life directly embodies nothing save potential freedom. Consequently they are not things and cannot be the property either of their parents or others.”
—Georg Wilhelm Friedrich Hegel (1770–1831)
“Unlike Descartes, we own and use our beliefs of the moment, even in the midst of philosophizing, until by what is vaguely called scientific method we change them here and there for the better. Within our own total evolving doctrine, we can judge truth as earnestly and absolutely as can be, subject to correction, but that goes without saying.”
—Willard Van Orman Quine (b. 1908)