Data Structures and Algorithms


It is Easier to Verify the Solution Than to Find it - III

Authors: Valdir Monteiro dos Santos Godoi

Introducing firstly the concepts of variable languages and languages with semantic and then without using them we presented original proofs of the famous P versus NP problem of Computer Science. These proofs don't implies that the NP-complete problems not belongs to P, so the P versus NP-complete problem remains open, as well as it is possible (perhaps) to solve the SAT problem in polynomial time.

Comments: 23 Pages. In portuguese.

Download: PDF

Submission history

[v1] 2019-08-18 04:47:28
[v2] 2019-08-18 18:21:44
[v3] 2019-09-03 07:55:02

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