The Complexity of Goldbach's Conjecture

Frank Vega
The Goldbach's conjecture has been described as the most difficult problem in the history of Mathematics. This conjecture states that every even integer greater than 2 can be written as the sum of two primes. The conjecture that all odd numbers greater than 7 are the sum of three odd primes is known today as the weak Goldbach conjecture. A major complexity classes are P and NSPACE(S(n)) for some S(n). We prove if the complexity...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.