The following pages link to Nitin Saxena (Q1630380):
Displayed 50 items.
- Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits (Q1630382) (← links)
- Deterministic identity testing for sum of read-once oblivious arithmetic branching programs (Q1686835) (← links)
- Polynomial interpolation and identity testing from high powers over finite fields (Q1709581) (← links)
- Erratum: ``PRIMES is in P'' (Q1711495) (← links)
- PRIMES is in P (Q1772458) (← links)
- A case of depth-3 identity testing, sparse factorization and duality (Q1947039) (← links)
- Algebraic independence and blackbox identity testing (Q1951567) (← links)
- Blackbox identity testing for sum of special ROABPs and its border class (Q2041244) (← links)
- Efficiently factoring polynomials modulo \(p^4\) (Q2229745) (← links)
- Complexity of ring morphism problems (Q2460031) (← links)
- Polynomial identity testing for depth 3 circuits (Q2472430) (← links)
- Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-$D$ Occur-$k$ Formulas and Depth-3 Transcendence Degree-$k$ Circuits (Q2817792) (← links)
- Progress on Polynomial Identity Testing-II (Q2821698) (← links)
- Entropy-based location management in long-term evolution cellular systems (Q2852838) (← links)
- Schemes for deterministic polynomial factoring (Q2883816) (← links)
- The Power of Depth 2 Circuits over Algebras (Q2920144) (← links)
- An Almost Optimal Rank Bound for Depth-3 Identities (Q2999861) (← links)
- Algebraic Independence and Blackbox Identity Testing (Q3012915) (← links)
- Trading GRH for algebra: Algorithms for factoring polynomials and related structures (Q3117221) (← links)
- Diagonal Circuit Identity Testing and Lower Bounds (Q3521908) (← links)
- Progress on Polynomial Identity Testing - II (Q3656204) (← links)
- (Q4601835) (← links)
- Integer Factoring Using Small Algebraic Dependencies (Q4608563) (← links)
- Algebraic Independence over Positive Characteristic: New Criterion and Applications to Locally Low Algebraic Rank Circuits (Q4608637) (← links)
- Blackbox Identity Testing for Bounded Top-Fanin Depth-3 Circuits: The Field Doesn't Matter (Q4907583) (← links)
- (Q5002729) (← links)
- (Q5091766) (← links)
- Irreducibility and Deterministic r-th Root Finding over Finite Fields (Q5119920) (← links)
- Efficiently Factoring Polynomials Modulo p4 (Q5120485) (← links)
- (Q5121898) (← links)
- Special-case algorithms for blackbox radical membership, nullstellensatz and transcendence degree (Q5145972) (← links)
- Deterministic polynomial factoring and association schemes (Q5170254) (← links)
- (Q5215662) (← links)
- Bootstrapping variables in algebraic circuits (Q5218580) (← links)
- Discovering the roots: uniform closure results for algebraic classes under factoring (Q5230370) (← links)
- Bootstrapping variables in algebraic circuits (Q5230371) (← links)
- Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits (Q5254013) (← links)
- PARAMETERS OF INTEGRAL CIRCULANT GRAPHS AND PERIODIC QUANTUM DYNAMICS (Q5292260) (← links)
- (Q5368763) (← links)
- Identity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs (Q5368905) (← links)
- Deterministic Polynomial Time Algorithms for Matrix Completion Problems (Q5390613) (← links)
- From sylvester-gallai configurations to rank bounds (Q5395729) (← links)
- Jacobian hits circuits (Q5415504) (← links)
- Blackbox identity testing for bounded top fanin depth-3 circuits (Q5419113) (← links)
- Algebraic independence in positive characteristic: A $p$-adic calculus (Q5420121) (← links)
- Equivalence of $\mathbb{F}$ -Algebras and Cubic Forms (Q5449791) (← links)
- Quasi-polynomial hitting-set for set-depth-Δ formulas (Q5495802) (← links)
- STACS 2005 (Q5710667) (← links)
- Computing Igusa’s local zeta function of univariates in deterministic polynomial-time (Q5853798) (← links)
- Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring (Q5889792) (← links)