>>11593980Suppose I have some algorithm that operates in polynomial time. For example, a simple implementation of NxN matrix multiplication has a time complexity of N squared. Given a statement and polynomial time complexity way to verify the statement, can it be proven or disproven that there exists a method, of the same time complexity, to derive the original statement. For example, given two invertible matrices, one can verify if they invert each other in N squared time complexity. However, given only one invertible matrix, one calculate the inverse in N squared time complexity?
