Jun Fukuyama's P≠NP Paper

From Polymath1Wiki

(Difference between revisions)
Jump to: navigation, search
(fix comment on peer reviewed papers. add piotr bermin)
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. he has emailed some leading complexity theory professors/researchers. the site has several papers. the main paper is 60 pages. there are several slideshow summaries/presentations/overviews including handwritten notes and diagrams and additional explanatory material.
+
[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. (its technically a proof to separate NP from P/Poly, the class of polynomial-size circuits.) he has emailed some leading complexity theory professors/researchers. the site has several papers. the main paper is 60 pages. there are several slideshow summaries/presentations/overviews including handwritten notes and diagrams and additional explanatory material.
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." he states in a blog comment the paper is submitted to Transactions on Computation Theory. he has posted and replied to comments on his blog. from the paper:
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." he states in a blog comment the paper is submitted to Transactions on Computation Theory. he has posted and replied to comments on his blog. from the paper:
Line 9: Line 9:
Fukuyama has joined the stackexchange TCS theory site as user [http://cstheory.stackexchange.com/users/13097/jun "jun"] and participated in an extensive online discussion in the chat room, has made and posted new google notes for clarifications in response, and is making modifications to the proof based on the discussion.
Fukuyama has joined the stackexchange TCS theory site as user [http://cstheory.stackexchange.com/users/13097/jun "jun"] and participated in an extensive online discussion in the chat room, has made and posted new google notes for clarifications in response, and is making modifications to the proof based on the discussion.
-
Fukuyama has a few published peer-reviewed papers in theoretical computer science or complexity theory. the main intermediate papers on Hamming code theory were published in "Congressus Numerantium", [http://math.fau.edu/cgtc/cgtc42/I Southeastern International Conference on Combinatorics, Graph Theory, and Computing]. his published peer reviewed papers are mainly with [http://www.cse.psu.edu/people/berman Piotr Berman] (Assoc prof, Penn State U) as the lead author.
+
Fukuyama has a few published peer-reviewed papers in theoretical computer science or complexity theory. the main intermediate papers utilized in the proof on Hamming code theory were published in "Congressus Numerantium", [http://math.fau.edu/cgtc/cgtc42/I Southeastern International Conference on Combinatorics, Graph Theory, and Computing]. his published peer reviewed papers are mainly with [http://www.cse.psu.edu/people/berman Piotr Berman] (Assoc prof, Penn State U) as the lead author.
discussion:
discussion:

Revision as of 16:27, 1 February 2013

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. (its technically a proof to separate NP from P/Poly, the class of polynomial-size circuits.) he has emailed some leading complexity theory professors/researchers. the site has several papers. the main paper is 60 pages. there are several slideshow summaries/presentations/overviews including handwritten notes and diagrams and additional explanatory material.

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." he states in a blog comment the paper is submitted to Transactions on Computation Theory. he has posted and replied to comments on his blog. from the paper:

Acknowledgement: The author would like to thank Professors Martin Fu ̈rer at Penn State, Osamu Watanabe at Tokyo Institute of Technology, and Eric Allender at Rutgers University for their good suggestions. Also, it has been very helpful of Professors Tadao Saito at the University of Tokyo and Hisashi Kobayashi at Princeton University to provide supports toward the submission of this paper.

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.

Fukuyama has joined the stackexchange TCS theory site as user "jun" and participated in an extensive online discussion in the chat room, has made and posted new google notes for clarifications in response, and is making modifications to the proof based on the discussion.

Fukuyama has a few published peer-reviewed papers in theoretical computer science or complexity theory. the main intermediate papers utilized in the proof on Hamming code theory were published in "Congressus Numerantium", Southeastern International Conference on Combinatorics, Graph Theory, and Computing. his published peer reviewed papers are mainly with Piotr Berman (Assoc prof, Penn State U) as the lead author.

discussion:

Personal tools