An algorithm is said to be polynomially bounded if its worst case running time is described by polynomail function of input size.
Polynomially Bounded problem
A problem is said to be Polynomially bounded if we have polynomial bounded algorithm for it.
-->P is a class of Problem that are polynomially bounded.
Ex-Sorting,Searching,Minimum Spanning Tree.
No comments:
Post a Comment