Jun Fukuyama's P≠NP Paper: Difference between revisions
No edit summary |
confirm phd thesis title. confirm submitted to journal. from his replies on his blog. |
||
| Line 1: | Line 1: | ||
[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 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." | [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 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." the paper is submitted to Transactions on Computation Theory. he has replied to comments on his blog. | ||
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 | 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 has a PhD in Theoretical Computer Science from Penn State University. his PhD dissertation is entitled "Approximability of Some Combinatorial Optimization Problems", 2001. | ||
* [http://news.ycombinator.com/item?id=4901849 hacker news reaction/discussion/commentary of proof, links, etc] | * [http://news.ycombinator.com/item?id=4901849 hacker news reaction/discussion/commentary of proof, links, etc] | ||
Revision as of 21:49, 11 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." the paper is submitted to Transactions on Computation Theory. he has replied to comments on his blog.
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 has a PhD in Theoretical Computer Science from Penn State University. his PhD dissertation is entitled "Approximability of Some Combinatorial Optimization Problems", 2001.
