1 P?=NP as minimization of degree 4 polynomial, integration or Grassmann number problem, and new graph isomorphism problem approaches Jarek Duda Jagiellonian University, Golebia 24, 31-007 Krakow, Poland, Email:
[email protected] Abstract—While the P vs NP problem is mainly approached problem, vertex cover problem, independent set problem, form the point of view of discrete mathematics, this paper subset sum problem, dominating set problem and graph proposes reformulations into the field of abstract algebra, ge- coloring problem. All of them stay in widely understood ometry, fourier analysis and of continuous global optimization - which advanced tools might bring new perspectives and field of discrete mathematics, like combinatorics, graph approaches for this question. The first one is equivalence of theory, logic. satisfaction of 3-SAT problem with the question of reaching The unsuccessfulness of a half century search for zero of a nonnegative degree 4 multivariate polynomial (sum the answer might suggest to try to look out of this of squares), what could be tested from the perspective of relatively homogeneous field - try to apply advances algebra by using discriminant. It could be also approached as a continuous global optimization problem inside [0; 1]n, of more distant fields of mathematics, like abstract for example in physical realizations like adiabatic quantum algebra fluent in working with the ring of polynomials, computers. However, the number of local minima usually use properties of multidimensional geometry, or other grows exponentially. Reducing to degree 2 polynomial plus continuous mathematics including numerical methods n constraints of being in f0; 1g , we get geometric formulations perfecting approaches for common problem of continuous as the question if plane or sphere intersects with f0; 1gn.