Jun Fukuyama's P≠NP Paper

From Polymath Wiki
Revision as of 15:27, 7 December 2012 by Vzn (talk | contribs) (New page: [http://www.linkedin.com/pub/junichiro-fukuyama/36/2b9/88b Jun Fukuyama] has been working on P vs NP for 10 yrs and created a blog, [http://junfukuyama.wordpress.com/ Jun Fukuyama's P≠NP...)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigationJump to search

Jun Fukuyama has been working on P vs NP for 10 yrs and created a blog, Jun Fukuyama's P≠NP Page on Jul 1 2012 to announce his recent proof. there does not seem to be further publicity by the author. the site has several papers. there are two entries so far on the blog dated Jul 1 and Aug 26. from the blog, "It’s a generalization of Razborov-Alon-Boppana proof of super polynomial monotone circuit complexity to compute cliques."

From his LinkedIn profile, Fukuyama was an Assistant Professor at Indiana State University 2001-2006 teaching undergraduate and graduate courses in computer science.

Retrieved from "https://michaelnielsen.org/polymath/index.php?title=Jun_Fukuyama%27s_P≠NP_Paper&oldid=6864"