pith. sign in

Nitin Saxena

Identifiers

  • name variant Nitin Saxena 0.60 · backfill

Papers (26)

  1. Counting basic-irreducible factors mod $p^k$ in deterministic poly-time and $p$-adic applications cs.SC · 2019 · author #3
  2. Efficiently factoring polynomials modulo $p^4$ cs.CC · 2019 · author #3
  3. Algebraic dependencies and PSPACE algorithms in approximative complexity cs.CC · 2018 · author #2
  4. Discovering the roots: Uniform closure results for algebraic classes under factoring cs.CC · 2017 · author #2
  5. Small hitting-sets for tiny arithmetic circuits or: How to turn bad designs into good cs.CC · 2017 · author #4
  6. Irreducibility and r-th root finding over finite fields cs.CC · 2017 · author #4
  7. Measurement of the in-plane thermal conductivity by steady-state infrared thermography physics.ins-det · 2016 · author #3
  8. Identity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs cs.CC · 2016 · author #3
  9. Polynomial Interpolation and Identity Testing from High Powers over Finite Fields math.NT · 2015 · author #4
  10. Deterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic Branching Programs cs.CC · 2014 · author #3
  11. Hitting-sets for ROABP and Sum of Set-Multilinear circuits cs.CC · 2014 · author #4
  12. Progress on Polynomial Identity Testing - II cs.CC · 2014 · author #1
  13. Hitting-sets for low-distance multilinear depth-3 cs.CC · 2013 · author #4
  14. Quasi-polynomial Hitting-set for Set-depth-Delta Formulas cs.CC · 2012 · author #3
  15. Deterministic Polynomial Factoring and Association Schemes cs.CC · 2012 · author #4
  16. Algebraic Independence in Positive Characteristic -- A p-Adic Calculus cs.CC · 2012 · author #2
  17. Jacobian hits circuits: Hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits cs.CC · 2011 · author #4
  18. Algebraic Independence and Blackbox Identity Testing cs.CC · 2011 · author #3
  19. Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter cs.CC · 2010 · author #1
  20. From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-box Identity Test for Depth-3 Circuits cs.CC · 2010 · author #1
  21. Deterministic Polynomial Time Algorithms for Matrix Completion Problems cs.DS · 2009 · author #3
  22. The Power of Depth 2 Circuits over Algebras cs.CC · 2009 · author #3
  23. Trading GRH for algebra: algorithms for factoring polynomials and related structures cs.CC · 2008 · author #4
  24. An Almost Optimal Rank Bound for Depth-3 Identities cs.CC · 2008 · author #1
  25. Schemes for Deterministic Polynomial Factoring cs.CC · 2008 · author #3
  26. Parameters of Integral Circulant Graphs and Periodic Quantum Dynamics quant-ph · 2007 · author #1

Mentions

  • 1406.7535 #4 · backfill · confidence 0.70 Nitin Saxena
  • 1401.0976 #1 · backfill · confidence 0.70 Nitin Saxena
  • 1312.1826 #4 · backfill · confidence 0.70 Nitin Saxena
  • 1209.2333 #3 · backfill · confidence 0.70 Nitin Saxena
  • 1205.5653 #4 · backfill · confidence 0.70 Nitin Saxena
  • 1202.4301 #2 · backfill · confidence 0.70 Nitin Saxena
  • 1111.0582 #4 · backfill · confidence 0.70 Nitin Saxena
  • 1102.2789 #3 · backfill · confidence 0.70 Nitin Saxena
  • 1011.3234 #1 · backfill · confidence 0.70 Nitin Saxena
  • 1002.0145 #1 · backfill · confidence 0.70 Nitin Saxena
  • 0907.0774 #3 · backfill · confidence 0.70 Nitin Saxena
  • 0904.2058 #3 · backfill · confidence 0.70 Nitin Saxena
  • 0811.3165 #4 · backfill · confidence 0.70 Nitin Saxena
  • 0811.3161 #1 · backfill · confidence 0.70 Nitin Saxena
  • 0804.1974 #3 · backfill · confidence 0.70 Nitin Saxena

Frequent Coauthors