HYDERABAD, TELANGANA 500076

ph: 914027174000

alt: 09052345550

gateguru

**USE THE SCROLL WHEEL ON YOUR MOUSE LIBERALLY TO VIEW THIS SITE.....**

*[The P=NP problem, NP-completeness, intractabililty and perhaps the whole of Computational Complexity has been deleted from the GATE syllabus. The present study is purely a hobbyist study and has yielded unexpected, interesting results.]*

ON THE TRACTABILITY OF NPCOMPLETENESS

WARNING!!!

This is an exploratory study and the student should not use the views and results here for any formal or informal educational or training purposes as the results and views are still not generally accepted.

*Christmas/New Year-2017*

+++++

**Note:**-*The present page prepared on Dec 31,2016 is dated. Today it is MAY DAY, 2017. Over the last 116 days we have the discovery of Lumpy's function which is a close analog and simulation of the Riemann zeta function and uses only real numbers. The zeroes of the Lumpy function can be related to points on RE(1/2) of the complex plane and a subset of them closely correspond to all the zeroes fo the Riemann zeta function. Rabbit is presently on the job trying to ger a deterministic polynomial time algorithm for integer factorisation using the Lumpy function along with the Piglet Transform on a Piglet Computer.*

*So it turns out that integer factorisation, discrete logarithm, elliptic curve discrete logarithm, the P=NP problem and may combinatorial problems have deterministic polynomial time complexity algorithm on the good 'ole RASP. So all current online and network cryptography is having a sword of Damocles hanging above it with the strand of hair being the 'invalidity' of the Riemann Hypothesis and this seems to be a pipe dream. *

*Though they cannnt resolve the problem Pooh and his friends are able to give a simple explanation of the zeroes of the Riemann zeta function and the Riemann Hyposthesis using the Piglet Trnsform and Lumpy's function. It is for the public good that the Piglet Transform and Lumpy's function cannot be made generally public at the present point of time but can be made available to respectable organisations.*

NOT IN GATE

“Believe nothing, no matter where you read it, or who said it, no matter if I have said it, unless it agrees with your own reason and your own common sense.”--The Buddha

Long, long ago---about half a century ago, in the ** First Course** on Algorithms, the Grand Sage of Algorithms had opined that nobody had come up with a proof that a non-trivial asymptotic time complexity claimed for any algorithm cannot be bettered. However it has become the fashion by vested interests over the last half a century especially with the globalisation of knowledge to enforce time complexities of algorithms with a liberal use of the 'birch'.

The argument ran as follows. A bunch of people got together. They announced that they were the 'greatest' and 'smartest'. They announced they could not better the time complexity of an algorithm beyond a point. So they announced that since they could not do it nobody can. They ordained that the time complexity be frozen eternally to what they have found. Over half a century this became the law and anyone trying to say otherwise would be subjected to a witch hunt, 'bashed up', 'softened' and has to face an auto da fe!

Penquin the new entry to the Roo-Pooh-Tigger studies says that he has been observing from the timeless Antartica the situation of 'fads' and 'beliefs' over the last so many centuries. Certain beliefs which are floating around are given the status of Hypotheses. By having the label of Hypothesis a belief is deified. Then it becomes a fanatical obesession to believe it to be correct and learned arguments are advanced to prove these hypes. This is why it took many centuries for the West to get over the 'hangup' of the Roman Number System and make a transition to the Arabic Positonal Notation and in the process a pontiff was almost condemned. These fanatical obsessions are fueled by vested interests. Some of them follow. Penquin concludes that it may take decades or even centuries for the Roo-Pooh-Tigger studies to be accepted though it can all be included in the secondary school curriculum!

SEEMINGLY INTRACTABLE PROBLEMS

**+++++**

**+++++**

** +++++**

**+++++**

*COOK'S THEOREM DEMYSTIFIED*

*(A common sense rendering)*

**+++++****+++++**

+++++

+++++

MOVES:001-200

MOVES:201-400

MOVES:401-600

MOVES:601-800

MOVES:801-999

..........

..........

SOLUTION NEEDS ~66,000 MOVES!!

ABOVE IS TRADITIONAL BACKTRACKING

**GOPHER USES TRACTABLE METHODS**

OUTSOURCING

**TACKLING THE PINK SLIP MONSTERS **

*****

****

***

**

*

**A POSSIBLE AVENUE**

** **

**+++++**

**+++++**

**VENUE OF THE NOCTURNAL ACTIVITIES OF POOH AND HIS FRIENDS -(2007-1017)**