2 papers
cs.CC2026
Approximate Polynomial Satisfiability is in the Counting Hierarchy
Nikhil Balaji, Mahsa Shirmohammadi, Sébastien Tavenas +1
The Approximate polynomial satisfiability problem (APS), introduced by Guo, Saxena, and Sinhababu (CCC 2018), asks whether the zero vector lies in the Zariski closure of the image…
cs.CC2024
A parametric version of the Hilbert Nullstellensatz
Rida Ait El Manssour, Nikhil Balaji, Klara Nosan +2
Hilbert's Nullstellensatz is a fundamental result in algebraic geometry that gives a necessary and sufficient condition for a finite collection of multivariate polynomials to have…