Nitin Saxena
VIDWAN ID: 53379

Prof Nitin Saxena

Male Doctor of Philosophy
Professor | Department of Computer Science and Engineering
Indian Institute of Technology, Kanpur
Uttar Pradesh
Expertise: Computer Science Theory and Methods
112 Publications
0 Projects
1775 Scopus Citations
1104 CrossRef
13 Years 5 Months Total Experience
Publications
112 Total
Articles
66
Chapters
4
Proceedings
42
Activity

No publication activity to display.

Scopus Scopus
1,775 Citations
19 h-index
CrossRef CrossRef
1,104 Citations
14 h-index
Google Scholar Google Scholar

Loading Scholar statistics...

Professional Recognition

Global Indus Technovators Awards
2003
Indian Institute of Technology Kanpur

Community & Membership

No Data Found

There is currently nothing to display here.

No Data Found

There is currently nothing to display here.

Personal Details

Doctor of Philosophy
2006
Indian Institute of Technology, Roorkee
Professor
Apr 2013 – Present
Indian Institute of Technology, Kanpur | Department of Computer Science and Engineering
Engineering and Technology
Computer Science Theory and Methods

Related Profiles

Scholarly Work

No Data Found

There is currently nothing to display here.

No Data Found

There is currently nothing to display here.

No Data Found

There is currently nothing to display here.

Scholarly Publications

Preface

Editorial
Year: 2011. Pages: 8 .

Algebraic dependencies and PSPACE algorithms in approximative complexity over any field

Open Access
Journal Article
Year: 2019. Volume: 15 , Issue: Special Issue .
Authors: Zeyu Guo; Nitin Saxena; Amit Sinhababu

Special-case algorithms for blackbox radical membership, nullstellensatz and transcendence degree

Conference Paper
Year: 2020. Pages: 186-193 .
Authors: Abhibhav Garg; Nitin Saxena

Research in theoretical computer science

Journal Article
Communications of the ACM. Year: 2019. Volume: 62 , Issue: 11 , Pages: 92-95 .
Authors: Meena Mahajan; Madhavan Mukund; Nitin Saxena

Blackbox identity testing for sum of special ROABPs and its border class

Journal Article
Computational Complexity. Year: 2021. Volume: 30 , Issue: 1 .
Authors: Pranav Bisht; Nitin Saxena

Efficiently factoring polynomials modulo p4

Open Access
Journal Article
Journal of Symbolic Computation. Year: 2021. Volume: 104 , Pages: 805-823 .
Authors: Ashish Dwivedi; Rajat Mittal; Nitin Saxena

A largish sum-of-squares implies circuit hardness and derandomization

Conference Paper
Year: 2021. Volume: 185 .

Separated borders: Exponential-gap fanin-hierarchy theorem for approximative depth-3 circuits

Open Access
Conference Paper
Year: 2022. Volume: 2022-October , Pages: 200-211 .
Authors: Pranjal Dutta; Nitin Saxena
Showing 1 to 8 of 112 publications