PPT-Computational Complexity
Polynomial time O n k input size n k constant Tractable problems solvable in polynomial timeOpposite Intractable Ex sorting whether number is prime shortest path
Download Presentation
Download Note : "Computational Complexity" is the property of its rightful owner. Permission is granted to download and print materials on this website for personal, non-commercial use only, provided you retain all copyright notices. By downloading content from our website, you accept the terms of this agreement.
Presentation Transcript
Transcript not available.