Jun Fukuyama's P≠NP Paper: Difference between revisions
No edit summary |
No edit summary |
||
| Line 3: | Line 3: | ||
From his LinkedIn profile, Fukuyama was an Assistant Professor at Indiana State University 2001-2006 teaching undergraduate and graduate courses in computer science. also from the profile he has over a half dozen published papers in computer science and electrical engineering. he apparently has a PhD in Theoretical Computer Science from Penn State University. his PhD dissertation detail is not given on the LinkedIn profile. | From his LinkedIn profile, Fukuyama was an Assistant Professor at Indiana State University 2001-2006 teaching undergraduate and graduate courses in computer science. also from the profile he has over a half dozen published papers in computer science and electrical engineering. he apparently has a PhD in Theoretical Computer Science from Penn State University. his PhD dissertation detail is not given on the LinkedIn profile. | ||
* [http://news.ycombinator.com/item?id=4901849 | * [http://news.ycombinator.com/item?id=4901849 hacker news reaction/discussion/commentary of proof] | ||
Revision as of 20:05, 10 December 2012
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. also from the profile he has over a half dozen published papers in computer science and electrical engineering. he apparently has a PhD in Theoretical Computer Science from Penn State University. his PhD dissertation detail is not given on the LinkedIn profile.
