On: Factoring may be easier than we think (2016)

[waynecochran]

The primality test has been whittled down to O(n^6) ... it seems that solutions to problems in P with high degree always get optimized over time.

Also, even a O(n^100) sol'n is way better than O(2^n) since (usually) I can parallelize polynomial time algorithms to something more practical: e.g., http://cds.iisc.ac.in/faculty/vss/courses/PPP2014/projects/p...