The devil is in Asymmetries (Rough Version)
classification
🧮 math.AG
cs.CC
keywords
asymmetriesobstaclestractabilityadmittedalgebraicbooleancombinatorialcomplex
read the original abstract
We formally investigate some computational obstacles to tractability of computing the variety determined by K complex polynomials in N boolean variables. We show that using algebraic methods for solving combinatorial problems, the obstacles to tractability lies in the order of magnitude of asymmetries admitted by the given system of equations.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.