Quote:
Originally Posted by bluemonday
Geek.
Greedy Geek.
I nearly have P vs NP down so you can strike than one off your list.
|
I'll believe you when I see its head on a platter. Which way did you resolve it P=NP or P!=NP?
I have some successive approximation style algorithms very fuzzily conceived, that I think will be polynomial time, to reduce the satisfactability problem to a lattice fixed point problem, which I believe will also be polynomial time. So I am going for proving P=NP--the opposite of what most people are trying.