#### Filter Results:

- Full text PDF available (77)

#### Publication Year

1991

2017

- This year (2)
- Last 5 years (25)
- Last 10 years (50)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

We present an unconditional deterministic polynomial-time algorithm that determines whether an input number is prime or composite.

- Manindra Agrawal
- FSTTCS
- 2005

In this paper, we formalize two stepwise approaches, based on pseudo-random generators, for proving P 6= NP and its arithmetic analog: Permanent requires superpolynomial sized arithmetic circuits.

- Manindra Agrawal, V. Vinay
- 2008 49th Annual IEEE Symposium on Foundations of…
- 2008

We show that proving exponential lower bounds on depth four arithmetic circuits imply exponential lower bounds for unrestricted depth arithmetic circuits. In other words, for exponential sized circuits additional depth beyond four does not help. We then show that a complete black-box derandomization of identity testing problem for depth four circuits with… (More)

- Manindra Agrawal, S. Akshay, Blaise Genest, P. S. Thiagarajan
- 2012 27th Annual IEEE Symposium on Logic in…
- 2012

A finite state Markov chain M is often viewed as a probabilistic transition system. An alternative view - which we follow here - is to regard M as a linear transform operating on the space of probability distributions over its set of nodes. The novel idea here is to discretize the probability value space [0,1] into a finite set of intervals. A concrete… (More)

- Manindra Agrawal, Somenath Biswas
- FOCS
- 1999

We give a simple and new randomized primality testing algorithm by reducing primality testing for number <i>n</i> to testing if a specific univariate identity over <i>Z<sub>n</sub></i> holds.We also give new randomized algorithms for testing if a multivariate polynomial, over a finite field or over rationals, is identically zero. The first of these… (More)

- Manindra Agrawal, Thomas Thierauf
- SIAM J. Comput.
- 2000

- Manindra Agrawal, Vikraman Arvind
- Structure in Complexity Theory Conference
- 1994

For any class IC E {NP,PP,C=P,@P} we show that i j K is quasi-linear truth-table reducible t o a pselective set then IC = P. For other ModkP classes (IC > 2/ we show that if ModkP is o(1og n)-truth-table reduci le to a p-selective set then ModkP = P.

- Manindra Agrawal
- IEEE Conference on Computational Complexity
- 2002

It is shown that if there exist sets in E that require -sized circuits then sets that are hard for class P, and above, under 1-1 reductions are also hard under 1-1, sizeincreasing reductions. Under the assumption of the hardness of solving RSA or Discrete Log problem, it is shown that sets that are hard for class NP, and above, under manyone reductions are… (More)

- Manindra Agrawal, Thomas Thierauf
- FOCS
- 1996

We investigate the computational complexity of the Boolean Isomorphism problem (BI): on input of two Boolean formulas F and G decide whether there exists a permutation of the variables of G such that F and G become equivalent. Our main result is a one-round interactive proof for BI, where the veriier has access to an NP oracle. To obtain this, we use a… (More)

- Manindra Agrawal, P. S. Thiagarajan
- HSCC
- 2005

We study the class of lazy linear hybrid automata with finite precision. The key features of this class are: – The observation of the continuous state and the rate changes associated with mode switchings take place with bounded delays. – The values of the continuous variables can be observed with only finite precision. – The guards controlling the… (More)