Compatibility matrix method

zbMATH Open1358.68115arXivcs/0703146MaRDI QIDQ2866554FDOQ2866554

Sergey Gubin

Publication date: 13 December 2013

Published in: JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0703146

Recommendations

• \(P\) versus \(NP\) and geometry
• \(\mathrm P \overset {?} {=} \mathrm{NP}\)
• An introduction to geometric complexity theory
• To the problem P=?NP
• scientific article; zbMATH DE number 4002078

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cited In (1)

• Generation of the compatibility matrix in the integrated force method

This page was built for publication: Compatibility matrix method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2866554)