The following pages link to Ramprasad Saptharishi (Q1947038):
Displaying 24 items.
- A case of depth-3 identity testing, sparse factorization and duality (Q1947039) (← links)
- Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-$D$ Occur-$k$ Formulas and Depth-3 Transcendence Degree-$k$ Circuits (Q2817792) (← links)
- A Selection of Lower Bounds for Arithmetic Circuits (Q2821696) (← links)
- Fast Integer Multiplication Using Modular Arithmetic (Q2840990) (← links)
- The Power of Depth 2 Circuits over Algebras (Q2920144) (← links)
- The Computational Power of Depth Five Arithmetic Circuits (Q4629389) (← links)
- (Q4636586) (← links)
- (Q4967171) (← links)
- Derandomization from Algebraic Hardness (Q5073523) (← links)
- (Q5090938) (← links)
- (Q5111162) (← links)
- (Q5207889) (← links)
- Near-optimal Bootstrapping of Hitting Sets for Algebraic Circuits (Q5236221) (← links)
- A super-polynomial lower bound for regular arithmetic formulas (Q5259548) (← links)
- Hitting sets for multilinear read-once algebraic branching programs, in any order (Q5259623) (← links)
- Efficiently Decoding Reed–Muller Codes From Random Errors (Q5280877) (← links)
- (Q5302073) (← links)
- (Q5351919) (← links)
- Efficiently decoding Reed-Muller codes from random errors (Q5361832) (← links)
- Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity (Q5368767) (← links)
- Jacobian hits circuits (Q5415504) (← links)
- Constructing Faithful Homomorphisms over Fields of Finite Characteristic. (Q5875643) (← links)
- (Q6138075) (← links)
- If VNP is hard, then so are equations for it (Q6490990) (← links)
