The devil is in Asymmetries (Rough Version)
Algebraic Geometry
2012-06-01 v1 Computational Complexity
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.
Cite
@article{arxiv.1205.6990,
title = {The devil is in Asymmetries (Rough Version)},
author = {Edinah K. Gnang and Vidit Nanda},
journal= {arXiv preprint arXiv:1205.6990},
year = {2012}
}