Data Structures and Algorithms


Comprehensive P vs NP Or, P as She is NP; the New Guide of the Conversion in Polynomial-Time and Exponential-Time.

Authors: Nicholas R. Wright

We use the whole order approach to solve the problem of P versus NP. The relation of the whole order within a beautiful order is imperative to understanding the total order. We also show several techniques observed by the minimum element, we call a logical minimum. The perfect zero-knowledge technique will deliver exactly the same. We conclude with a demonstration of the halting problem.

Comments: 8 Pages. Changed Moore's Law from "<" to ">" and changed Fait Accompli to Compte Rendu

Download: PDF

Submission history

[v1] 2017-08-04 01:51:06
[v2] 2017-10-11 04:03:46
[v3] 2018-02-14 22:49:05
[v4] 2019-07-09 14:43:44

Unique-IP document downloads: 133 times is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus