#### Filter Results:

- Full text PDF available (46)

#### Publication Year

1982

2019

- This year (4)
- Last 5 years (22)
- Last 10 years (51)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

We present a deterministic polynomial-time algorithm that determines whether an input number n is prime or composite. “The problem of distinguishing prime numbers from composite numbers and of… (More)

- Manindra Agrawal, V. Vinay
- FOCS
- 2008

- 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, Somenath Biswas
- J. ACM
- 2003

We give a simple and new randomized primality testing algorithm by reducing primality testing for number n to testing if a specific univariate identity over Zn holds.We also give new randomized… (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… (More)

- Manindra Agrawal, Eric Allender, Steven Rudich
- J. Comput. Syst. Sci.
- 1998

We show that all sets that are complete for NP under non-uniform AC0 reductions are isomorphic under non-uniform AC0-computable isomorphisms. Furthermore, these sets remain NP-complete even under… (More)

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

We introduce the class of lazy rectangular hybrid automata. The key feature of this class is that both the observation of the continuous state and the rate changes associated with mode switchings… (More)

- Manindra Agrawal, Thomas Thierauf
- Electronic Colloquium on Computational Complexity
- 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… (More)

- Manindra Agrawal, Eric Allender, Samir Datta
- J. Comput. Syst. Sci.
- 1997

- Manindra Agrawal
- Structure in Complexity Theory Conference
- 1994

The isomorphism conjecture states that all NPcomplete sets are polynomial-time isomorphic while the encrypted complete set conjecture states that there is a p-one-way function f and an NP-complete… (More)