Can the graph isomorphism problem be solved in polynomial time? Can parity games be solved in polynomial time? Can the rotation distance between two binary trees be computed in polynomial time? Does linear programming admit a strongly polynomial-time algorithm? This is problem #9 in Smale’s list of problems

Need assistance with this?