Catch up on stories from the past week (and beyond) at the Slashdot story archive

 



Forgot your password?
typodupeerror

Slashdot videos: Now with more Slashdot!

  • View

  • Discuss

  • Share

We've improved Slashdot's video section; now you can view our video interviews, product close-ups and site visits with all the usual Slashdot options to comment, share, etc. No more walled garden! It's a work in progress -- we hope you'll check it out (Learn more about the recent updates).

×
Math

+ - new serious claim on P!=NP->

Submitted by Anonymous Coward
An anonymous reader writes "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.

http://www.linkedin.com/pub/junichiro-fukuyama/36/2b9/88b

rumor is that its been submitted to a journal. it uses a known plausible approach based on monotone circuit theory for which there are some long established existing proofs of circuit lower bounds (dating to a celebrated 1985 proof by Razborov). Fukuyama has published several papers in computer science. it would be great if the online community could give this some attention as with the Deolalikar proof from 2.5yrs ago."

Link to Original Source
This discussion was created for logged-in users only, but now has been archived. No new comments can be posted.

new serious claim on P!=NP

Comments Filter:

Nothing in progression can rest on its original plan. We may as well think of rocking a grown man in the cradle of an infant. -- Edmund Burke

Working...