Agrawal, Manindra - Department of Computer Science and Engineering, Indian Institute of Technology Kanpur

• Classifying Polynomials and Identity Testing Manindra Agrawal
• Primality Tests Based on Fermat's Little Manindra Agrawal
• Automorphisms of Finite Rings and Applications to Complexity of Problems
• PRIMES is in P Manindra Agrawal Neeraj Kayal
• One-Way Functions and the Berman-Hartmanis Manindra Agrawal
• The Isomorphism Conjecture for Constant Depth Manindra Agrawal
• Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem
• Two Problems of Number Theory Manindra Agarwal
• The Isomorphism Conjecture Manindra Agrawal
• Determinant Versus Permanent Manindra Agrawal
• Is n a Prime Number? Manindra Agrawal
• Fermat's Last Theorem: From Integers to Elliptic Curves
• Automorphisms of Finite Rings and Applications to Complexity of
• CS681: Endterm Examination Maximum Marks: 50
• CS 681: Computational Number Theory and Algebra Lecture 2: Reed Solomon code
• "!$#%'&(&0)132$4'56!$#7'&&8!$29 BDCFEG2HIAPQ@GPQRTSUVXWYC$2H@
• Equivalence of F-algebras and cubic forms Manindra Agrawal and Nitin Saxena
• Behavioural Approximations for Restricted Linear Differential Hybrid Automata
• Morphisms of Rings and Applications to A Thesis Submitted
• DSPACE(n) ? = NSPACE(n): A Degree Theoretic
• Determinant Versus Permanent Manindra Agrawal
• Numbers of Strange Kind and Their Applications
• Primality Tests Based on Fermat's Little Manindra Agrawal
• NP-Creative Sets: A New Class of Creative Sets in NP
• Pinpointing Computation with Modular Queries in the Boolean Manindra Agrawal
• CS 681: Computational Number Theory and Algebra Lecture 4: Arithmetic over Z:Division
• The Discrete Time Behavior of Lazy Linear Hybrid Automata
• DERANDOMIZING SOME NUMBER-THEORETIC AND ALGEBRAIC ALGORITHMS.
• International Journal of Foundations of Computer Science c World Scientific Publishing Company
• Arithmetic Circuits: A Chasm at Depth Four Manindra Agrawal
• A Short History of "PRIMES is in P" Manindra Agrawal
• Pseudo-Random Generators and Structure of Complete Degrees Manindra Agrawal
• Proving Lower Bounds via Pseudo-Random Manindra Agrawal
• For Completeness, Sublogarithmic Space is No Space Manindra Agrawal
• Proving Lower Bounds via Pseudo-Random Manindra Agrawal
• The P = NP Problem Manindra Agarwal
• Introduction Two Applications Basic Operations Tools Overview of the Tools A Survey of Techniques Used in
• On the Isomorphism Conjecture for Weak Reducibilities Manindra Agrawal
• The Satisfiability Problem for Probabilistic Ordered Branching Programs
• The polynomially bounded perfect matching problem is in NC2
• Polynomial-Time Isomorphism of 1-L-Complete Sets
• The Isomorphism Conjecture for NP Manindra Agrawal
• PRIMES is in P Manindra Agrawal, Neeraj Kayal and Nitin Saxena
• Determinant Versus Permanent Manindra Agrawal
• Towards Uniform AC -Isomorphisms
• On Derandomizing Tests for Certain Polynomial Identities Manindra Agrawal
• comput. complex. 10 (2001), 117 138 1016-3328/01/02011722 $ 1.50+0.20/0
• On the Complexity of Certain Algebraic and Number Theoretic