#### Filter Results:

- Full text PDF available (26)

#### Publication Year

2002

2019

- This year (4)
- Last 5 years (25)
- Last 10 years (45)

#### Supplemental Content

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

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

- Neeraj Kayal, Nitin Saxena
- computational complexity
- 2005

Abstract.We study the identity testing problem for depth 3 arithmetic circuits (
$$\sum\prod\sum$$
circuit). We give the first deterministic polynomial time identity test for
$$\sum\prod\sum$$
… (More)

The intention of the paper is to move a step towards a classification of network topologies that exhibit periodic quantum dynamics. We show that the evolution of a quantum system, whose hamiltonian… (More)

- Gábor Ivanyos, Marek Karpinski, Nitin Saxena
- SIAM J. Comput.
- 2010

We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e., the problem of assigning values to the variables in a… (More)

- Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena
- Electronic Colloquium on Computational Complexity
- 2014

We give a $n^{O(\log n)}$-time ($n$ is the input size) blackbox polynomial identity testing algorithm for unknown-order read-once oblivious algebraic branching programs (ROABP). The best result known… (More)

- Gábor Ivanyos, Marek Karpinski, Nitin Saxena
- ISSAC
- 2008

In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects, we call m-schemes, that are generalizations of permutation groups.… (More)

- Neeraj Kayal, Nitin Saxena
- computational complexity
- 2006

Abstract.We study the complexity of the isomorphism and automorphism problems for finite rings. We show that both integer factorization and graph isomorphism reduce to the problem of counting… (More)

- Gábor Ivanyos, Marek Karpinski, Miklos Santha, Nitin Saxena, Igor E. Shparlinski
- Algorithmica
- 2015

We consider the problem of recovering (that is, interpolating) and identity testing of a “hidden” monic polynomial f, given an oracle access to $${f}{(x)}^e$$f(x)e for $$x\in \mathbb {F}_q$$x∈Fq,… (More)

- Nitin Saxena
- Algebraic Methods in Computational Complexity
- 2007

In this talk we give a deterministic polynomial time algorithm for testing whether a {em diagonal}
depth-$3$ circuit $C(arg{x}{n})$ (i.e. $C$ is a sum of powers of linear functions) is
zero.

- Nitin Saxena
- Electronic Colloquium on Computational Complexity
- 2009

The problem of Identity Testing consists in given an arithmetic circuit that computes a polynomial p in a field, decide whether p is the zero polynomial. One of the first examples of probabilistic… (More)