35 citations · 107 across the 11 of their papers we have counts for
4 papers · 1 filter
On Closure Properties of Read-Once Oblivious Algebraic Branching Programs
Jules Armand, Prateek Dwivedi, Magnus Rahbek Dalgaard Hansen +3
We investigate the closure properties of read-once oblivious Algebraic Branching Programs (roABPs) under various natural algebraic operations and prove the following. - Non-closure…
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…
Monotone Bounded-Depth Complexity of Homomorphism Polynomials
C. S. Bhargav, Shiteng Chen, Radu Curticapean +1
For every fixed graph , it is known that homomorphism counts from and colorful -subgraph counts can be determined in time on -vertex input graphs , whe…
Emergence of Order in Chemically Active Droplets: Temporal Dynamics and Collective Behavior
Sobiya Ashraf, Pawan Kumar, Prateek Dwivedi +3
Collective behaviors such as swarming, chemical signaling, and clustering are fundamental to biological microorganisms, enabling hierarchical colony formation, coordinated motion,…