C. Bhargav

collaborators

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

Monotone Bounded-Depth Complexity of Homomorphism Polynomials

C. S. Bhargav, Shiteng Chen, Radu Curticapean +1

For every fixed graph $H$ , it is known that homomorphism counts from $H$ and colorful $H$ -subgraph counts can be determined in $O (n^{t + 1})$ time on $n$ -vertex input graphs $G$ , whe…