Bhargav Thankey

12 papers A* 2A 1Journal 7Unranked 2
YearRankTypeTitle / Venue / Authors
2025 — conf
BrakingBase - A Linear Prover, Poly-Logarithmic Verifier, Field Agnostic Polynomial Commitment Scheme.
ASIACRYPT (5)
Vineet Nair, Ashish Sharma, Bhargav Thankey
2024 J jnl
BrakingBase - a linear prover, poly-logarithmic verifier, field agnostic polynomial commitment scheme.
IACR Cryptol. ePrint Arch.
Vineet Nair, Ashish Sharma, Bhargav Thankey
2024 J jnl
Hitting Sets for Orbits of Circuit Classes and Polynomial Families.
ACM Trans. Comput. Theory
Chandan Saha, Bhargav Thankey
2023 A* conf
Equivalence Test for Read-Once Arithmetic Formulas.
SODA
Nikhil Gupta, Chandan Saha, Bhargav Thankey
2023 A* conf
Low-Depth Arithmetic Circuit Lower Bounds: Bypassing Set-Multilinearization.
ICALP
Prashanth Amireddy, Ankit Garg, Neeraj Kayal, Chandan Saha, Bhargav Thankey
2022 J jnl
Equivalence Test for Read-Once Arithmetic Formulas.
Electron. Colloquium Comput. Complex.
Nikhil Gupta, Chandan Saha, Bhargav Thankey
2022 J jnl
Low-depth arithmetic circuit lower bounds via shifted partials.
CoRR
Prashanth Amireddy, Ankit Garg, Neeraj Kayal, Chandan Saha, Bhargav Thankey
2022 J jnl
Low-depth arithmetic circuit lower bounds via shifted partials.
Electron. Colloquium Comput. Complex.
Prashanth Amireddy, Ankit Garg, Neeraj Kayal, Chandan Saha, Bhargav Thankey
2021 — conf
Hitting Sets for Orbits of Circuit Classes and Polynomial Families.
APPROX-RANDOM
Chandan Saha, Bhargav Thankey
2021 J jnl
Hitting Sets for Orbits of Circuit Classes and Polynomial Families.
Electron. Colloquium Comput. Complex.
Chandan Saha, Bhargav Thankey
2020 A conf
A Super-Quadratic Lower Bound for Depth Four Arithmetic Circuits.
CCC
Nikhil Gupta, Chandan Saha, Bhargav Thankey
2020 J jnl
A Super-Quadratic Lower Bound for Depth Four Arithmetic Circuits.
Electron. Colloquium Comput. Complex.
Nikhil Gupta, Chandan Saha, Bhargav Thankey