Editing P versus NP problem (section)

==Similar problems==
* ''[[R (complexity)|R]] vs. [[RE (complexity)|RE]]'' problem, where R is analog of class P, and RE is analog class NP.  These classes are not equal, because undecidable but verifiable problems do exist, for example, [[Hilbert's tenth problem]] which is [[RE (complexity)#RE-complete|RE-complete]].<ref name="W2019"></ref>
* A similar problem exists in the theory of [[Arithmetic circuit complexity#Algebraic P and NP|algebraic complexity]]: ''VP vs. VNP'' problem. Like ''P vs. NP'', the answer is currently unknown.<ref>L. G. Valiant. ''Completeness classes in algebra.'' In Proc. of 11th ACM STOC, pp. 249–261, 1979.</ref><ref name="W2019">{{cite book | last = Wigderson | first = Avi | author-link=Avi Wigderson|title = Mathematics and Computation: A Theory Revolutionizing Technology and Science | publisher = Princeton University Press| year = 2019 | isbn = 978-0-691-18913-0}}</ref>