Pratik Shastri

11 papers A 3Journal 7Unranked 1
YearRankTypeTitle / Venue / Authors
2026 A conf
Lower Bounds for Noncommutative Circuits with Low Syntactic Degree.
ITCS
Pratik Shastri
2026 J jnl
Lower Bounds for Planar Arithmetic Circuits.
ACM Trans. Comput. Theory
C. Ramya, Pratik Shastri
2025 J jnl
Efficient Polynomial Identity Testing Over Nonassociative Algebras.
CoRR
Partha Mukhopadhyay, C. Ramya, Pratik Shastri
2025 J jnl
Efficient Polynomial Identity Testing Over Nonassociative Algebras.
Electron. Colloquium Comput. Complex.
Partha Mukhopadhyay, C. Ramya, Pratik Shastri
2025 A conf
Efficient Polynomial Identity Testing over Nonassociative Algebras.
APPROX/RANDOM
Partha Mukhopadhyay, C. Ramya, Pratik Shastri
2025 J jnl
Lower Bounds for Noncommutative Circuits with Low Syntactic Degree.
Electron. Colloquium Comput. Complex.
Pratik Shastri
2025 J jnl
Lower bounds for planar Arithmetic Circuits.
CoRR
C. Ramya, Pratik Shastri
2025 — conf
On the Hardness of Order Finding and Equivalence Testing for ROABPs.
FSTTCS
C. Ramya, Pratik Shastri
2025 J jnl
On the Hardness of Order Finding and Equivalence Testing for ROABPs.
CoRR
C. Ramya, Pratik Shastri
2024 A conf
Lower Bounds for Planar Arithmetic Circuits.
ITCS
C. Ramya, Pratik Shastri
2023 J jnl
Lower Bounds for Planar Arithmetic Circuits.
Electron. Colloquium Comput. Complex.
C. Ramya, Pratik Shastri