26 citations · 26 across the 6 of their papers we have counts for
5 papers · 1 filter
Tight Lower Bounds for Algebraic Communication and Applications
Manon Blanc, Prateek Dwivedi, Magnus Rahbek Dalgaard Hansen +2
Communication complexity studies how much information must be exchanged to solve a problem whose input is split among several parties. The classical setting deals with Boolean inpu…
Lower Bounds in Algebraic Complexity via Symmetry and Homomorphism Polynomials
Prateek Dwivedi, Benedikt Pago, Tim Seppelt
Valiant's conjecture asserts that the circuit complexity classes VP and VNP are distinct, meaning that the permanent does not admit polynomial-size algebraic circuits. As it is the…
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…