What good books are there on the subject of P = NP, NP-completeness and the like?
I have Fortnow's "The Golden Ticket" and Garey & Johnson's "Computers and Intractability"
How else can I get into the subject and slowly creep towards the forefront of research? Who is actively researching it? What literature/publications can I read to bring me up to speed?
>>8642107
I'm also interested in this kind of thing. I haven't heard any news on it recently besides that one guy in Chicago doing some sort of graph isomorphism problem in psuedo-polynomial time.
>>8642214
I made a duplicate thread on /g/ and an anon posted this:
http://www.scottaaronson.com/papers/pnp.pdf
>>8642214
Graph isomorphism is not NP-C. Subgraph isomorphism is.
ive never understood the deal about p=np
just divide p on both sides and you get p/p=1, so 1=n, so p=1*p; p=p; scientists are so dumb smmh
>>8642231
HAHAHHAHA
SO FUKING ORIGINAL!
"quantum computing since democritus"
>>8642280
you're doing it wrong
>HILARIOUS AND ORIGINAL
>>8642231
You discovered my BR ratio. To you I gift Humanity.
Would you like to name yourself? Mine is Simon.