Combinatorics and Graph Theory


A Polynomial Time and Non-Heuristic Solution for NP-Complete Problems (Clique, TSP & Sudoku)(P=NP)

Authors: John Archie Gillis

The present article takes a novel approach to solving NP-Complete problems and provides steps that a computational device and software program can follow to accurately solve NP-class problems without the use of heuristics or brute force methods. The present methods are fast and accurate if utilized properly. The paper states that the solution to solving the P vs NP question (and our ability to design algorithms to solve such problems efficiently) lies in a novel method presented for searching, filtering, combining and structuring data, which describes a novel method for breaking specific problems into logical groupings that the present inventor (John Archie Gillis) has defined as collaborative variables. They utilize novel binary representations/conversions, so that one can more easily and quickly determine selected and desired informational outputs. Many have stated that a solution to this problem will create the world’s first trillionaire as it addresses many pattern-matching and optimization problems that are of great practical interest, such as determining the optimal arrangement of transistors on a silicon chip, developing accurate financial-forecasting models, or analyzing protein-folding behaviour in a cell. Since all the NP-complete optimization problems become easy with the present methods, everything will be much more efficient. Transportation of all forms can now also be scheduled optimally to move people and goods around quicker and cheaper. Manufacturers can improve their production to increase speed and create less waste. Developments in vision recognition, language comprehension, translation and many other learning tasks will now become much simpler as well. It is felt that by utilizing the systems of the present invention in numerous fields, that the present paper will have profound implications for mathematics, cryptography, algorithm research, artificial intelligence, game theory, internet packet routing, multimedia processing, philosophy, economics and many other fields.

Comments: 30 Pages.

Download: PDF

Submission history

[v1] 2019-07-16 06:58:12

Unique-IP document downloads: 120 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