Chakrabarti, Sayak; Saxena, Nitin An effective description of the roots of bivariates \(\bmod p^k\) and the related Igusa’s local zeta function. (English) Zbl 07760756 Dickenstein, Alicia (ed.) et al., Proceedings of the 48th international symposium on symbolic and algebraic computation, ISSAC, Tromsø, Norway, July 24–27, 2023. New York, NY: Association for Computing Machinery (ACM). 135-144 (2023). MSC: 68W30 PDFBibTeX XMLCite \textit{S. Chakrabarti} and \textit{N. Saxena}, in: Proceedings of the 48th international symposium on symbolic and algebraic computation, ISSAC, Tromsø, Norway, July 24--27, 2023. New York, NY: Association for Computing Machinery (ACM). 135--144 (2023; Zbl 07760756) Full Text: DOI
Batra, Rishabh; Saxena, Nitin; Shringi, Devansh Explicit construction of \(q+1\) regular local Ramanujan graphs, for all prime-powers \(q\). (English) Zbl 07709617 Comput. Complexity 32, No. 1, Paper No. 2, 34 p. (2023). MSC: 68-XX PDFBibTeX XMLCite \textit{R. Batra} et al., Comput. Complexity 32, No. 1, Paper No. 2, 34 p. (2023; Zbl 07709617) Full Text: DOI
Dutta, Pranjal; Saxena, Nitin; Sinhababu, Amit Discovering the roots: uniform closure results for algebraic classes under factoring. (English) Zbl 07679914 J. ACM 69, No. 3, Paper No. 18, 39 p. (2022). MSC: 68-XX PDFBibTeX XMLCite \textit{P. Dutta} et al., J. ACM 69, No. 3, Paper No. 18, 39 p. (2022; Zbl 07679914) Full Text: DOI
Dutta, Pranjal; Dwivedi, Prateek; Saxena, Nitin Deterministic identity testing paradigms for bounded top-fanin depth-4 circuits. (English) Zbl 07711593 Kabanets, Valentine (ed.), 36th computational complexity conference, CCC 2021, Toronto, Ontario, Canada, virtual conference, July 20–23, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 200, Article 11, 27 p. (2021). MSC: 68Q25 PDFBibTeX XMLCite \textit{P. Dutta} et al., LIPIcs -- Leibniz Int. Proc. Inform. 200, Article 11, 27 p. (2021; Zbl 07711593) Full Text: DOI arXiv
Bisht, Pranav; Saxena, Nitin Blackbox identity testing for sum of special ROABPs and its border class. (English) Zbl 1522.68239 Comput. Complexity 30, No. 1, Paper No. 8, 48 p. (2021). MSC: 68Q25 68Q06 68W20 68W30 PDFBibTeX XMLCite \textit{P. Bisht} and \textit{N. Saxena}, Comput. Complexity 30, No. 1, Paper No. 8, 48 p. (2021; Zbl 1522.68239) Full Text: DOI
Dwivedi, Ashish; Mittal, Rajat; Saxena, Nitin Efficiently factoring polynomials modulo \(p^4\). (English) Zbl 1465.13022 J. Symb. Comput. 104, 805-823 (2021). Reviewer: Manjit Singh (Murthal) MSC: 13P05 94B05 PDFBibTeX XMLCite \textit{A. Dwivedi} et al., J. Symb. Comput. 104, 805--823 (2021; Zbl 1465.13022) Full Text: DOI
Dwivedi, Ashish; Saxena, Nitin Computing Igusa’s local zeta function of univariates in deterministic polynomial-time. (English) Zbl 1457.11166 Galbraith, Steven D. (ed.), ANTS XIV. Proceedings of the fourteenth algorithmic number theory symposium, Auckland, New Zealand, virtual event, June 29 – July 4, 2020. Berkeley, CA: Mathematical Sciences Publishers (MSP). Open Book Ser. 4, 197-214 (2020). MSC: 11S40 68Q01 68W30 11Y16 14G50 PDFBibTeX XMLCite \textit{A. Dwivedi} and \textit{N. Saxena}, Open Book Ser. 4, 197--214 (2020; Zbl 1457.11166) Full Text: DOI arXiv
Garg, Abhibhav; Saxena, Nitin Special-case algorithms for blackbox radical membership, Nullstellensatz and transcendence degree. (English) Zbl 07300070 Mantzaflaris, Angelos (ed.), Proceedings of the 45th international symposium on symbolic and algebraic computation, ISSAC ’20, Kalamata, Greece, July 20–23, 2020. New York, NY: Association for Computing Machinery (ACM). 186-193 (2020). MSC: 68W30 PDFBibTeX XMLCite \textit{A. Garg} and \textit{N. Saxena}, in: Proceedings of the 45th international symposium on symbolic and algebraic computation, ISSAC '20, Kalamata, Greece, July 20--23, 2020. New York, NY: Association for Computing Machinery (ACM). 186--193 (2020; Zbl 07300070) Full Text: DOI arXiv
Saxena, Nitin (ed.); Simon, Sunil (ed.) 40th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2020, Goa, India, virtual conference, December 14–18, 2020. (English) Zbl 1451.68027 LIPIcs – Leibniz International Proceedings in Informatics 182. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-174-0). viii, 58 articles, not consecutively paged, electronic only, open access (2020). MSC: 68-06 68N30 68Qxx 00B25 PDFBibTeX XMLCite \textit{N. Saxena} (ed.) and \textit{S. Simon} (ed.), 40th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2020, Goa, India, virtual conference, December 14--18, 2020. Wadern: Schloss Dagstuhl -- Leibniz Zentrum für Informatik (2020; Zbl 1451.68027) Full Text: DOI Link
Dwivedi, Ashish; Mittal, Rajat; Saxena, Nitin Counting basic-irreducible factors mod\(p^k\) in deterministic poly-time and \(p\)-adic applications. (English) Zbl 07564415 Shpilka, Amir (ed.), 34th computational complexity conference, CCC 2019, New Brunswick, NJ, USA, July 18–20, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 137, Article 15, 29 p. (2019). MSC: 68Q25 PDFBibTeX XMLCite \textit{A. Dwivedi} et al., LIPIcs -- Leibniz Int. Proc. Inform. 137, Article 15, 29 p. (2019; Zbl 07564415) Full Text: DOI arXiv
Dwivedi, Ashish; Mittal, Rajat; Saxena, Nitin Efficiently factoring polynomials modulo \(p^4\). (English) Zbl 1467.11113 Bradford, Russell (ed.), Proceedings of the 44th international symposium on symbolic and algebraic computation, ISSAC ’19, Beijing, China, July 15–18, 2019. New York, NY: Association for Computing Machinery (ACM). 139-146 (2019). MSC: 11T06 11Y05 13P05 68W30 PDFBibTeX XMLCite \textit{A. Dwivedi} et al., in: Proceedings of the 44th international symposium on symbolic and algebraic computation, ISSAC '19, Beijing, China, July 15--18, 2019. New York, NY: Association for Computing Machinery (ACM). 139--146 (2019; Zbl 1467.11113) Full Text: DOI arXiv
Agrawal, Manindra; Ghosh, Sumanta; Saxena, Nitin Bootstrapping variables in algebraic circuits. (English) Zbl 1433.68151 Proc. Natl. Acad. Sci. USA 116, No. 17, 8107-8118 (2019). MSC: 68Q15 68Q17 68W20 PDFBibTeX XMLCite \textit{M. Agrawal} et al., Proc. Natl. Acad. Sci. USA 116, No. 17, 8107--8118 (2019; Zbl 1433.68151) Full Text: DOI
Guo, Zeyu; Saxena, Nitin; Sinhababu, Amit Algebraic dependencies and \(\mathsf{PSPACE}\) algorithms in approximative complexity over any field. (English) Zbl 1456.68058 Theory Comput. 15, Paper No. 16, 30 p. (2019). MSC: 68Q25 11T06 14Q20 68W30 PDFBibTeX XMLCite \textit{Z. Guo} et al., Theory Comput. 15, Paper No. 16, 30 p. (2019; Zbl 1456.68058) Full Text: DOI
Alpak, F. O.; Zacharoudiou, I.; Berg, S.; Dietderich, J.; Saxena, N. Direct simulation of pore-scale two-phase visco-capillary flow on large digital rock images using a phase-field lattice Boltzmann method on general-purpose graphics processing units. (English) Zbl 1425.76196 Comput. Geosci. 23, No. 5, 849-880 (2019). MSC: 76M28 76S05 86A60 PDFBibTeX XMLCite \textit{F. O. Alpak} et al., Comput. Geosci. 23, No. 5, 849--880 (2019; Zbl 1425.76196) Full Text: DOI
Agrawal, Manindra; Kayal, Neeraj; Saxena, Nitin Erratum: “PRIMES is in P”. (English) Zbl 1432.11180 Ann. Math. (2) 189, No. 1, 317-318 (2019). MSC: 11Y11 11Y16 68Q25 68Q15 11A51 PDFBibTeX XMLCite \textit{M. Agrawal} et al., Ann. Math. (2) 189, No. 1, 317--318 (2019; Zbl 1432.11180) Full Text: DOI
Forbes, Michael A.; Ghosh, Sumanta; Saxena, Nitin Towards blackbox identity testing of log-variate circuits. (English) Zbl 1499.68390 Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 54, 16 p. (2018). MSC: 68W20 68Q06 PDFBibTeX XMLCite \textit{M. A. Forbes} et al., LIPIcs -- Leibniz Int. Proc. Inform. 107, Article 54, 16 p. (2018; Zbl 1499.68390) Full Text: DOI
Guo, Zeyu; Saxena, Nitin; Sinhababu, Amit Algebraic dependencies and PSPACE algorithms in approximative complexity. (English) Zbl 1442.68062 Servedio, Rocco A. (ed.), 33rd computational complexity conference, CCC 2018, June 22–24, 2018, San Diego, California, USA. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 102, Article 10, 21 p. (2018). MSC: 68Q15 14Q20 68Q25 PDFBibTeX XMLCite \textit{Z. Guo} et al., LIPIcs -- Leibniz Int. Proc. Inform. 102, Article 10, 21 p. (2018; Zbl 1442.68062) Full Text: DOI arXiv
Agrawal, Manindra; Ghosh, Sumanta; Saxena, Nitin Bootstrapping variables in algebraic circuits. (English) Zbl 1427.68356 Diakonikolas, Ilias (ed.) et al., Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC ’18, Los Angeles, CA, USA, June 25–29, 2018. New York, NY: Association for Computing Machinery (ACM). 1166-1179 (2018). MSC: 68W20 68Q17 68Q25 94C11 PDFBibTeX XMLCite \textit{M. Agrawal} et al., in: Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC '18, Los Angeles, CA, USA, June 25--29, 2018. New York, NY: Association for Computing Machinery (ACM). 1166--1179 (2018; Zbl 1427.68356) Full Text: DOI
Dutta, Pranjal; Saxena, Nitin; Sinhababu, Amit Discovering the roots: uniform closure results for algebraic classes under factoring. (English) Zbl 1428.68398 Diakonikolas, Ilias (ed.) et al., Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC ’18, Los Angeles, CA, USA, June 25–29, 2018. New York, NY: Association for Computing Machinery (ACM). 1152-1165 (2018). MSC: 68W30 12-08 12D10 68Q25 PDFBibTeX XMLCite \textit{P. Dutta} et al., in: Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC '18, Los Angeles, CA, USA, June 25--29, 2018. New York, NY: Association for Computing Machinery (ACM). 1152--1165 (2018; Zbl 1428.68398) Full Text: DOI arXiv
Alpak, F. Omer; Gray, F.; Saxena, N.; Dietderich, J.; Hofmann, R.; Berg, S. A distributed parallel multiple-relaxation-time lattice Boltzmann method on general-purpose graphics processing units for the rapid and scalable computation of absolute permeability from high-resolution 3D micro-CT images. (English) Zbl 1405.86017 Comput. Geosci. 22, No. 3, 815-832 (2018). MSC: 86A22 65Y10 76M28 86A60 PDFBibTeX XMLCite \textit{F. O. Alpak} et al., Comput. Geosci. 22, No. 3, 815--832 (2018; Zbl 1405.86017) Full Text: DOI
Pandey, Anurag; Saxena, Nitin; Sinhababu, Amit Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits. (English) Zbl 1446.12001 Comput. Complexity 27, No. 4, 617-670 (2018). MSC: 12-08 68W30 68Q25 PDFBibTeX XMLCite \textit{A. Pandey} et al., Comput. Complexity 27, No. 4, 617--670 (2018; Zbl 1446.12001) Full Text: DOI Link
Ivanyos, Gábor; Karpinski, Marek; Santha, Miklos; Saxena, Nitin; Shparlinski, Igor E. Polynomial interpolation and identity testing from high powers over finite fields. (English) Zbl 1390.11128 Algorithmica 80, No. 2, 560-575 (2018). MSC: 11T06 11Y16 68Q12 68Q25 PDFBibTeX XMLCite \textit{G. Ivanyos} et al., Algorithmica 80, No. 2, 560--575 (2018; Zbl 1390.11128) Full Text: DOI arXiv
Bhargava, Vishwas; Ivanyos, Gábor; Mittal, Rajat; Saxena, Nitin Irreducibility and deterministic \(r\)-th root finding over finite fields. (English) Zbl 1472.11297 Burr, Michael (ed.), Proceedings of the 42nd international symposium on symbolic and algebraic computation, ISSAC 2017, Kaiserslautern, Germany, July 25–28, 2017. New York, NY: Association for Computing Machinery (ACM). 37-44 (2017). MSC: 11T06 11Y16 68W30 PDFBibTeX XMLCite \textit{V. Bhargava} et al., in: Proceedings of the 42nd international symposium on symbolic and algebraic computation, ISSAC 2017, Kaiserslautern, Germany, July 25--28, 2017. New York, NY: Association for Computing Machinery (ACM). 37--44 (2017; Zbl 1472.11297) Full Text: DOI arXiv
Gurjar, Rohit; Korwar, Arpita; Saxena, Nitin; Thierauf, Thomas Deterministic identity testing for sum of read-once oblivious arithmetic branching programs. (English) Zbl 1382.68110 Comput. Complexity 26, No. 4, 835-880 (2017). MSC: 68Q25 68W30 PDFBibTeX XMLCite \textit{R. Gurjar} et al., Comput. Complexity 26, No. 4, 835--880 (2017; Zbl 1382.68110) Full Text: DOI arXiv Link
Gurjar, Rohit; Korwar, Arpita; Saxena, Nitin Identity testing for constant-width, and any-order, read-once oblivious arithmetic branching programs. (English) Zbl 1378.68080 Theory Comput. 13, Paper No. 2, 21 p. (2017). MSC: 68Q25 12Y05 68W30 PDFBibTeX XMLCite \textit{R. Gurjar} et al., Theory Comput. 13, Paper No. 2, 21 p. (2017; Zbl 1378.68080) Full Text: DOI arXiv
Pandey, Anurag; Saxena, Nitin; Sinhababu, Amit Algebraic independence over positive characteristic: new criterion and applications to locally low algebraic rank circuits. (English) Zbl 1398.68697 Faliszewski, Piotr (ed.) et al., 41st international symposium on mathematical foundations of computer science, MFCS 2016, Kraków, Poland, August 22–26, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-016-3). LIPIcs – Leibniz International Proceedings in Informatics 58, Article 74, 15 p. (2016). MSC: 68W30 12Y05 68Q17 PDFBibTeX XMLCite \textit{A. Pandey} et al., LIPIcs -- Leibniz Int. Proc. Inform. 58, Article 74, 15 p. (2016; Zbl 1398.68697) Full Text: DOI
Agrawal, Manindra; Saxena, Nitin; Srivastava, Shubham Sahai Integer factoring using small algebraic dependencies. (English) Zbl 1398.11153 Faliszewski, Piotr (ed.) et al., 41st international symposium on mathematical foundations of computer science, MFCS 2016, Kraków, Poland, August 22–26, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-016-3). LIPIcs – Leibniz International Proceedings in Informatics 58, Article 6, 14 p. (2016). MSC: 11Y16 11Y05 11Y40 PDFBibTeX XMLCite \textit{M. Agrawal} et al., LIPIcs -- Leibniz Int. Proc. Inform. 58, Article 6, 14 p. (2016; Zbl 1398.11153) Full Text: DOI
Gurjar, Rohit; Korwar, Arpita; Saxena, Nitin Identity testing for constant-width, and commutative, read-once oblivious ABPs. (English) Zbl 1380.68224 Raz, Ran (ed.), 31st conference on computational complexity, CCC’16, Tokyo, Japan, May 29 – June 1, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-008-8). LIPIcs – Leibniz International Proceedings in Informatics 50, Article 29, 16 p. (2016). MSC: 68Q25 12Y05 68P05 PDFBibTeX XMLCite \textit{R. Gurjar} et al., LIPIcs -- Leibniz Int. Proc. Inform. 50, Article 29, 16 p. (2016; Zbl 1380.68224) Full Text: DOI
Agrawal, Manindra; Saha, Chandan; Saptharishi, Ramprasad; Saxena, Nitin Jacobian hits circuits: hitting sets, lower bounds for depth-\(D\) occur-\(k\) formulas and depth-3 transcendence degree-\(k\) circuits. (English) Zbl 1350.68292 SIAM J. Comput. 45, No. 4, 1533-1562 (2016). MSC: 68W30 68Q05 68Q25 94C10 PDFBibTeX XMLCite \textit{M. Agrawal} et al., SIAM J. Comput. 45, No. 4, 1533--1562 (2016; Zbl 1350.68292) Full Text: DOI
Gurjar, Rohit; Korwar, Arpita; Saxena, Nitin; Thierauf, Thomas Deterministic identity testing for sum of read-once oblivious arithmetic branching programs. (English) Zbl 1388.68118 Zuckerman, David (ed.), 30th conference on computational complexity, CCC’15, Portland, OR, USA, June 17–19, 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-81-1). LIPIcs – Leibniz International Proceedings in Informatics 33, 323-346 (2015). MSC: 68Q25 68Q05 PDFBibTeX XMLCite \textit{R. Gurjar} et al., LIPIcs -- Leibniz Int. Proc. Inform. 33, 323--346 (2015; Zbl 1388.68118) Full Text: DOI
Agrawal, Manindra; Gurjar, Rohit; Korwar, Arpita; Saxena, Nitin Hitting-sets for ROABP and sum of set-multilinear circuits. (English) Zbl 1327.68339 SIAM J. Comput. 44, No. 3, 669-697 (2015). MSC: 68W30 68Q25 94C10 PDFBibTeX XMLCite \textit{M. Agrawal} et al., SIAM J. Comput. 44, No. 3, 669--697 (2015; Zbl 1327.68339) Full Text: DOI arXiv
Saxena, Nitin Progress on polynomial identity testing. II. (English) Zbl 1345.68182 Agrawal, Manindra (ed.) et al., Perspectives in computational complexity. The Somenath Biswas anniversary volume. Selected papers based on the presentations at the workshop, Kanpur, India, Summer 2012. Cham: Birkhäuser/Springer (ISBN 978-3-319-05445-2/hbk; 978-3-319-05446-9/ebook). Progress in Computer Science and Applied Logic 26, 131-146 (2014). MSC: 68Q25 12Y05 13P05 68Q05 68Q17 68W30 68-02 PDFBibTeX XMLCite \textit{N. Saxena}, Prog. Comput. Sci. Appl. Log. 26, 131--146 (2014; Zbl 1345.68182) Full Text: DOI
Arora, Manuel; Ivanyos, Gábor; Karpinski, Marek; Saxena, Nitin Deterministic polynomial factoring and association schemes. (English) Zbl 1320.11116 LMS J. Comput. Math. 17, 123-140 (2014). MSC: 11T06 11Y16 05E30 12E05 68W30 PDFBibTeX XMLCite \textit{M. Arora} et al., LMS J. Comput. Math. 17, 123--140 (2014; Zbl 1320.11116) Full Text: DOI arXiv
Mittmann, Johannes; Saxena, Nitin; Scheiblechner, Peter Algebraic independence in positive characteristic: a \(p\)-adic calculus. (English) Zbl 1350.13015 Trans. Am. Math. Soc. 366, No. 7, 3425-3450 (2014). MSC: 13F20 13F35 14F30 14F40 68Q17 68W30 PDFBibTeX XMLCite \textit{J. Mittmann} et al., Trans. Am. Math. Soc. 366, No. 7, 3425--3450 (2014; Zbl 1350.13015) Full Text: DOI arXiv
Agrawal, Manindra; Saha, Chandan; Saxena, Nitin Quasi-polynomial hitting-set for set-depth-\({\Delta}\) formulas. (English) Zbl 1293.94140 Proceedings of the 45th annual ACM symposium on theory of computing, STOC ’13. Palo Alto, CA, USA, June 1–4, 2013. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2029-0). 321-330 (2013). MSC: 94C10 68W30 PDFBibTeX XMLCite \textit{M. Agrawal} et al., in: Proceedings of the 45th annual ACM symposium on theory of computing, STOC '13. Palo Alto, CA, USA, June 1--4, 2013. New York, NY: Association for Computing Machinery (ACM). 321--330 (2013; Zbl 1293.94140) Full Text: DOI arXiv
Saxena, Nitin; Seshadhri, C. From Sylvester-Gallai configurations to rank bounds: improved blackbox identity test for depth-3 circuits. (English) Zbl 1281.68231 J. ACM 60, No. 5, Article No. 33, 33 p. (2013). MSC: 68W20 68W30 68W40 PDFBibTeX XMLCite \textit{N. Saxena} and \textit{C. Seshadhri}, J. ACM 60, No. 5, Article No. 33, 33 p. (2013; Zbl 1281.68231) Full Text: DOI
Beecken, M.; Mittmann, J.; Saxena, N. Algebraic independence and blackbox identity testing. (English) Zbl 1281.68107 Inf. Comput. 222, 2-19 (2013). MSC: 68Q05 68Q25 68Q45 68W30 13P25 PDFBibTeX XMLCite \textit{M. Beecken} et al., Inf. Comput. 222, 2--19 (2013; Zbl 1281.68107) Full Text: DOI
Saha, Chandan; Saptharishi, Ramprasad; Saxena, Nitin A case of depth-3 identity testing, sparse factorization and duality. (English) Zbl 1311.68201 Comput. Complexity 22, No. 1, 39-69 (2013). MSC: 68W30 68Q25 94C12 PDFBibTeX XMLCite \textit{C. Saha} et al., Comput. Complexity 22, No. 1, 39--69 (2013; Zbl 1311.68201) Full Text: DOI
Agrawal, Manindra; Saha, Chandan; Saptharishi, Ramprasad; Saxena, Nitin Jacobian hits circuits: hitting-sets, lower bounds for depth-\(D\) occur-\(k\) formulas & depth-\(3\) transcendence degree-\(k\) circuits. (English) Zbl 1286.94115 Karloff, Howard J. (ed.) et al., Proceedings of the 44th annual ACM symposium on theory of computing, STOC 2012. New York, NY, USA, May 19–22, 2012. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-1245-5). 599-614 (2012). MSC: 94C10 PDFBibTeX XMLCite \textit{M. Agrawal} et al., in: Proceedings of the 44th annual ACM symposium on theory of computing, STOC 2012. New York, NY, USA, May 19--22, 2012. New York, NY: Association for Computing Machinery (ACM). 599--614 (2012; Zbl 1286.94115) Full Text: DOI arXiv
Roy, Abhishek; Shin, Jitae; Saxena, Nitin Entropy-based location management in long-term evolution cellular systems. (English) Zbl 1273.94090 IET Commun. 6, No. 2, 138-146 (2012). MSC: 94A05 68M10 62P30 PDFBibTeX XMLCite \textit{A. Roy} et al., IET Commun. 6, No. 2, 138--146 (2012; Zbl 1273.94090) Full Text: DOI
Saxena, Nitin; Seshadhri, C. Blackbox identity testing for bounded top-fanin depth-3 circuits: the field doesn’t matter. (English) Zbl 1272.68162 SIAM J. Comput. 41, No. 5, 1285-1298 (2012). MSC: 68Q25 12Y05 68W30 PDFBibTeX XMLCite \textit{N. Saxena} and \textit{C. Seshadhri}, SIAM J. Comput. 41, No. 5, 1285--1298 (2012; Zbl 1272.68162) Full Text: DOI arXiv
Ivanyos, Gábor; Karpinski, Marek; Rónyai, Lajos; Saxena, Nitin Trading GRH for algebra: algorithms for factoring polynomials and related structures. (English) Zbl 1239.68080 Math. Comput. 81, No. 277, 493-531 (2012). Reviewer: Gábor Horváth (Debrecen) MSC: 12Y05 11T06 16Z05 68W30 PDFBibTeX XMLCite \textit{G. Ivanyos} et al., Math. Comput. 81, No. 277, 493--531 (2012; Zbl 1239.68080) Full Text: DOI
Saxena, Nitin; Seshadhri, C. Blackbox identity testing for bounded top fanin depth-3 circuits, the field doesn’t matter. (English) Zbl 1288.68138 Proceedings of the 43rd annual ACM symposium on theory of computing, STOC ’11. San Jose, CA, USA, June 6–8, 2011. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-0691-1). 431-440 (2011). MSC: 68Q25 12Y05 68W30 94C10 94C12 PDFBibTeX XMLCite \textit{N. Saxena} and \textit{C. Seshadhri}, in: Proceedings of the 43rd annual ACM symposium on theory of computing, STOC '11. San Jose, CA, USA, June 6--8, 2011. New York, NY: Association for Computing Machinery (ACM). 431--440 (2011; Zbl 1288.68138) Full Text: DOI
Beecken, Malte; Mittmann, Johannes; Saxena, Nitin Algebraic independence and blackbox identity testing. (English) Zbl 1333.68134 Aceto, Luca (ed.) et al., Automata, languages and programming. 38th international colloquium, ICALP 2011, Zurich, Switzerland, July 4–8, 2011. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-22011-1/pbk). Lecture Notes in Computer Science 6756, 137-148 (2011). MSC: 68Q25 13B25 68W20 PDFBibTeX XMLCite \textit{M. Beecken} et al., Lect. Notes Comput. Sci. 6756, 137--148 (2011; Zbl 1333.68134) Full Text: DOI arXiv
Saxena, Nitin; Seshadhri, C. An almost optimal rank bound for depth-3 identities. (English) Zbl 1216.68133 SIAM J. Comput. 40, No. 1, 200-224 (2011). MSC: 68Q25 68W40 PDFBibTeX XMLCite \textit{N. Saxena} and \textit{C. Seshadhri}, SIAM J. Comput. 40, No. 1, 200--224 (2011; Zbl 1216.68133) Full Text: DOI Link
Ivanyos, Gábor; Karpinski, Marek; Saxena, Nitin Deterministic polynomial time algorithms for matrix completion problems. (English) Zbl 1209.68269 SIAM J. Comput. 39, No. 8, 3736-3751 (2010). MSC: 68Q17 16D99 68W30 PDFBibTeX XMLCite \textit{G. Ivanyos} et al., SIAM J. Comput. 39, No. 8, 3736--3751 (2010; Zbl 1209.68269) Full Text: DOI
Saha, Chandan; Saptharishi, Ramprasad; Saxena, Nitin The power of depth 2 circuits over algebras. (English) Zbl 1248.68262 Kannan, Ravi (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2009), December 15–17, 2009, Kanpur, India. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-13-2). LIPIcs – Leibniz International Proceedings in Informatics 4, 371-382, electronic only (2009). MSC: 68Q25 68Q05 68W30 68Q15 12Y05 68W20 PDFBibTeX XMLCite \textit{C. Saha} et al., LIPIcs -- Leibniz Int. Proc. Inform. 4, 371--382 (2009; Zbl 1248.68262) Full Text: DOI Link
Ivanyos, Gábor; Karpinski, Marek; Saxena, Nitin Schemes for deterministic polynomial factoring. (English) Zbl 1237.68100 May, John P. (ed.), ISSAC 2009. Proceedings of the 2009 International Symposium on Symbolic and Algebraic Computation, Seoul, July 28–31, 2009. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-609-0). 191-198 (2009). MSC: 68W30 12Y05 11T06 PDFBibTeX XMLCite \textit{G. Ivanyos} et al., in: Proceedings of the 2009 international symposium on symbolic and algebraic computation, ISSAC 2009, Seoul, July 28--31, 2009. New York, NY: Association for Computing Machinery (ACM). 191--198 (2009; Zbl 1237.68100) Full Text: DOI
Saxena, Nitin Progress on polynomial identity testing. (English) Zbl 1188.68154 Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 99, 49-79 (2009). MSC: 68Q17 68Q25 PDFBibTeX XMLCite \textit{N. Saxena}, Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 99, 49--79 (2009; Zbl 1188.68154) Full Text: arXiv
Saxena, Nitin Diagonal circuit identity testing and lower bounds. (English) Zbl 1152.68703 Aceto, Luca (ed.) et al., Automata, languages and programming. 35th international colloquium, ICALP 2008, Reykjavik, Iceland, July 7–11, 2008. Proceedings, Part I. Berlin: Springer (ISBN 978-3-540-70574-1/pbk). Lecture Notes in Computer Science 5125, 60-71 (2008). MSC: 68W30 68Q17 68Q25 94C10 PDFBibTeX XMLCite \textit{N. Saxena}, Lect. Notes Comput. Sci. 5125, 60--71 (2008; Zbl 1152.68703) Full Text: DOI Link
Kayal, Neeraj; Saxena, Nitin Polynomial identity testing for depth 3 circuits. (English) Zbl 1173.94470 Comput. Complexity 16, No. 2, 115-138 (2007). MSC: 94C12 PDFBibTeX XMLCite \textit{N. Kayal} and \textit{N. Saxena}, Comput. Complexity 16, No. 2, 115--138 (2007; Zbl 1173.94470) Full Text: DOI
Saxena, Nitin; Severini, Simone; Shparlinski, Igor E. Parameters of integral circulant graphs and periodic quantum dynamics. (English) Zbl 1119.81042 Int. J. Quantum Inf. 5, No. 3, 417-430 (2007). MSC: 81P68 68R10 PDFBibTeX XMLCite \textit{N. Saxena} et al., Int. J. Quantum Inf. 5, No. 3, 417--430 (2007; Zbl 1119.81042) Full Text: DOI arXiv
Agrawal, Manindra; Saxena, Nitin Equivalence of \(\mathbb{F}\)-algebras and cubic forms. (English) Zbl 1137.68064 Durand, Bruno (ed.) et al., STACS 2006. 23rd annual symposium on theoretical aspects of computer science, Marseille, France, February 23–25, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-32301-3/pbk). Lecture Notes in Computer Science 3884, 115-126 (2006). MSC: 68W30 68Q25 13P99 11Y16 11E76 PDFBibTeX XMLCite \textit{M. Agrawal} and \textit{N. Saxena}, Lect. Notes Comput. Sci. 3884, 115--126 (2006; Zbl 1137.68064) Full Text: DOI
Kayal, Neeraj; Saxena, Nitin Complexity of ring morphism problems. (English) Zbl 1125.68057 Comput. Complexity 15, No. 4, 342-390 (2006). MSC: 68Q15 13P99 PDFBibTeX XMLCite \textit{N. Kayal} and \textit{N. Saxena}, Comput. Complexity 15, No. 4, 342--390 (2006; Zbl 1125.68057) Full Text: DOI
Agrawal, Manindra; Saxena, Nitin Automorphisms of finite rings and applications to complexity of problems. (English) Zbl 1119.68093 Diekert, Volker (ed.) et al., STACS 2005. 22nd annual symposium on theoretical aspects of computer science, Stuttgart, Germany, February 24–26, 2005. Proceedings. Berlin: Springer (ISBN 3-540-24998-2/pbk). Lecture Notes in Computer Science 3404, 1-17 (2005). MSC: 68Q25 11Y16 PDFBibTeX XMLCite \textit{M. Agrawal} and \textit{N. Saxena}, Lect. Notes Comput. Sci. 3404, 1--17 (2005; Zbl 1119.68093) Full Text: DOI
Agrawal, Manindra; Kayal, Neeraj; Saxena, Nitin PRIMES is in P. (English) Zbl 1071.11070 Ann. Math. (2) 160, No. 2, 781-793 (2004). Reviewer: Preda Mihailescu (Göttingen) MSC: 11Y11 11Y16 68Q25 68Q15 11A51 PDFBibTeX XMLCite \textit{M. Agrawal} et al., Ann. Math. (2) 160, No. 2, 781--793 (2004; Zbl 1071.11070) Full Text: DOI