2014/02/27 by Edinah K. Gnang, Gnang, Edinah K.
Computer Science · Engineering · Mathematics · #Advanced Combinatorial Mathematics #Combinatorics (math.CO) #FOS: Mathematics #Polynomial and algebraic computation #graph theory and CDMA systems #math.CO
paper · pdf · doi:10.48550/arxiv.1402.6920
arxiv created 2014/02/27 · openalex publication_date 2014/02/27 · arxiv updated 2014/02/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/04
We discuss here some computational aspects of the Combinatorial Nullstellensatz argument. Our main result shows that the order of magnitude of the symmetry group associated with permutations of the variables in algebraic constraints, determines the performance of algorithms naturally deduced from Alon's Combinatorial Nullstellensatz arguments. Finally we present a primal-dual polynomial constructions for certifying the existence or the non-existence of solutions to combinatorial problems.