Viewing profile — vznvzn

there are indeed dozens of incorrect papers which make neophyte errors. however, this one was written by a TCS Phd [from what I can tell] with a respectable number of published pap…

thats what I meant. was writing P/poly != NP to mean "NP is not a subset of P/poly". or do we have to worry about the case where P/poly is a superset of NP? have never even conside…

oops. thx for info. didnt notice that. new to this. sorry for multiple replies that should just be edits.

"as far as I know, proving an exponential lower bound for an NP complete problem doesnt immediately rule that P!=NP". that statement is FALSE . P!=NP is exactly a consequence of pr…

P/Poly is NOT polynomial depth circuits. it is you that is mistaken about this complexity class characterization. it is polynomial SIZE circuits. other statements of your post are …

have not dug into the paper, but basically if it can be shown that NP cannot be computed with Poly-size circuits, then P!=NP, ie a weaker consequence of the stronger NP!=P/Poly. th…

"its not clear that he's confident enough yet to invite more active discussion on his effort from the theory community". that is highly debatable; arguably that was his intent in c…

here chow elaborates further/in depth on the "natural" condition in the Razborov Rudich proof & finds some evidence for "nearby" functions that potentially could be used to defy th…

hi AK. maybe consider blogging about this? this is a well written but superficial analysis. scott aaronson insists on his blog that a proof should explain why it succeeds against "…

hi all. meant to post a comment but didnt understand this hackernews interface so far, am brand new to this site. fukuyama states on his web page he's worked on P vs NP for over 10…

a new serious proof claim on P!=NP has been put forward by a Phd mathematician/computer scientist Jun Fukuyama last July 1 and has received very little public attention since then.…