I'll believe you when I see its head on a platter. Which way did you resolve it P=NP or P!=NP?
yeah - like I'm gonna just spill here :rolli:
i'll show you mine, if you show me yours
Originally Posted by ygolo
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.
whew! is it getting hot in here or what?
Originally Posted by Ivy
Gosh, the world looks so small from up here on my high horse of menstruation.