computational complexity - AKS Primality Test not a polynomial time algorithm? - Mathematics Stack Exchange
A deterministic polynomial-time algorithm for approximating mixed discriminant and mixed volume | Proceedings of the thirty-second annual ACM symposium on Theory of computing
Introduction to Theoretical Computer Science: Polynomial time reductions
Introduction to Theoretical Computer Science: Polynomial time reductions
algorithm - Polynomial time and exponential time - Stack Overflow
P vs. NP — What is the Difference Between Solving a Problem and Recognizing its Solution? | by Eliran Natan | Cantor's Paradise
Time complexity - Wikipedia
Part-8: Polynomial Time Complexity O(n^c)
Polynomial Time - Intro to Theoretical Computer Science - YouTube
Polynomial Or Exponential Running Time Solution - Intro to Theoretical Computer Science - YouTube
graphs - What is a polynomial-time algorithm for determining whether two trees, with colored nodes, are isomorphic or not - Computer Science Stack Exchange
Polynomial Time -- from Wolfram MathWorld
NP-Complete Problems Polynomial time vs exponential time - ppt video online download