It is not the case that Constants hidden in Big-O notation (e.g., O(n^100)) can make formally polynomial algorithms computationally infeasible for all practical input sizes.
?Set your confidence on the premises below to see your aggregate.
No one has weighed in yet. Be the first to share reasons for or against this statement.