The following pages link to Nitin Saxena (Q1630380):
Displaying 9 items.
- Explicit construction of \(q+1\) regular local Ramanujan graphs, for all prime-powers \(q\) (Q6113103) (← links)
- (Q6115364) (← links)
- Counting basic-irreducible factors mod $p^k$ in deterministic poly-time and $p$-adic applications (Q6314372) (← links)
- Weighted sum-of-squares lower bounds for univariate polynomials imply \(\mathsf{VP} \neq \mathsf{VNP}\) (Q6542431) (← links)
- Solving polynomial systems over non-fields and applications to modular polynomial factoring (Q6543078) (← links)
- Improved lower bound, and proof barrier, for constant depth algebraic circuits (Q6584012) (← links)
- Derandomization via symmetric polytopes: poly-time factorization of certain sparse polynomials (Q6604610) (← links)
- VDOO: a short, fast, post-quantum multivariate digital signature scheme (Q6623354) (← links)
- Lower bounds for the sum of small-size algebraic branching programs (Q6636102) (← links)
