Similar Items

• On the solution of the 3rd Clay Millennium problem. A short and elegant proof that P ≠ NP in the context of deterministic turing machines and Zermelo-Frankel set theory.
  by: Konstantinos Kyritsis
  Published: (2017)
• The solution to the 3RD Clay Millennium Problem. A short proof that P not equal to NP and NP = Exptime in the context of Zermelo-Frankel set theory
  by: Konstantinos Kyritsis
  Published: (2018)
• On the solution of the 4th clay millennium problem. Proof of the regularity of the solutions of the Euler and Navier-Stokes equations, based on the conservation of particles as a local structure of the fluid, formulated in the context of continuous fluid mechanics.
  by: Kyritsis, Constantinos
  Published: (2017)
• On the 4th Clay millennium problem: Proof of the regularity of the solutions of the Euler and Navier-Stokes equations, based on the conservation of particles
  by: Kyritsis Konstantinos
  Published: (2017)
• Computers and intractability a guide to the theory of NP-completeness
  by: Garey, Michael R.
  Published: (1979)