DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Neeraj Kayal
Neeraj Kayal
Patent Filed, Commercialized & Granted Data
Design Programme Indian Institute of Technology Kanpur
Thesis Title
Contents
A Super-Quadratic Lower Bound for Depth Four Arithmetic
Algorithms for the Multiplication Table Problem
Reconstruction of Non-Degenerate Homogeneous Depth Three Circuits
A Selection of Lower Bounds for Arithmetic Circuits
Mathematisches Forschungsinstitut Oberwolfach Complexity Theory
Leakage-Resilience of the Shamir Secret-Sharing Scheme Against Physical-Bit Leakages
From the AMS Secretary
Polynomial Time Primality Testing Algorithm
From the AMS Secretary
ERIC W. ALLENDER Department of Computer Science
CV (Nitin Saxena)
Towards Blackbox Identity Testing of Log-Variate Circuits
Interactions of Computational Complexity Theory and Mathematics
Mathematisches Forschungsinstitut Oberwolfach Complexity Theory
Top View
2006 Fulkerson Prize
Towards an Algebraic Natural Proofs Barrier Via Polynomial Identity Testing
Algebraic Geometry and Representation Theory in the Study
ACM SIGACT News Distributed Computing Column 22
Towards a Characterization of the Symmetries of the Nisan-Wigderson Polynomial Family
Learning Sums of Powers of Low-Degree Polynomials in the Non
Elliptic Curves, Cryptography and Computation
PRIMES Is in P
Functional Lower Bounds for Arithmetic Circuits and Connections to Boolean Circuit Complexity
A Note on the Storage Requirement for AKS Primality Testing Algorithm
Researchers Devise Fast Deterministic Algorithm for Primality Testing
Designing a Subscription Service for Earthquake Big Data Analysis from Multiple Sources
Arithmetic Cryptography∗
Barriers for Rank Methods in Arithmetic Complexity
Algebraic Dependencies and PSPACE Algorithms in Approximative Complexity Over Any Field
Partial Derivatives in Arithmetic Complexity and Beyond Full Text Available At
PRIMES Is in P
Notation and Sources of Quotations, Images, and Ornaments
Bibliography
UCSD Computer Science and Engineering
Derandomizing Some Number-Theoretic and Algebraic Algorithms
STOC 2012 Corporate Supporters
An Almost Cubic Lower Bound for Depth Three Arithmetic Circuits∗
John Von Neumann
International Mathematics Research Notices
PRIMES Is in P: a Breakthrough for “Everyman” Folkmar Bornemann
On the Symmetries of and Equivalence Test for Design
PRIMES Is in P
PRIMALITY TESTING ALGORITHMS Introduction
On Learning and Lower Bound Problems Related to the Iterated Matrix Multiplication Polynomial
Report for the Academic Year 2006-2007