activity
20172026
most citedP?=NP as minimization of degree 4 polynomial, integration or Grassmann number problem, and new graph isomorphism problem approaches

1 citations · 1 across the 10 of their papers we have counts for

collaborators
Showing cs.CCShow all

2 papers · 1 filter

cs.CC2024

Simple inexpensive vertex and edge invariants distinguishing dataset strongly regular graphs

Jarek Duda

While standard Weisfeiler-Leman vertex labels are not able to distinguish even vertices of regular graphs, there is proposed and tested family of inexpensive polynomial time vertex…

cs.CC2017★ 1 cited

P?=NP as minimization of degree 4 polynomial, integration or Grassmann number problem, and new graph isomorphism problem approaches

Jarek Duda

While the P vs NP problem is mainly approached form the point of view of discrete mathematics, this paper proposes reformulations into the field of abstract algebra, geometry, four…