2 papers
cs.CC2026
A primer on the closure of algebraic complexity classes under factoring
C. S. Bhargav, Prateek Dwivedi, Nitin Saxena
Polynomial factorisation is a fundamental problem in computational algebra. Over the past half century, a variety of algorithmic techniques have been developed to tackle different…
cs.CC2025
Primes via Zeros: Interactive Proofs for Testing Primality of Natural Classes of Ideals
Abhibhav Garg, Rafael Oliveira, Nitin Saxena
A central question in mathematics and computer science is the question of determining whether a given ideal is prime, which geometrically corresponds to the zero set of , de…