Join Our Newsletter

ECCC

2011

12 years 4 months ago
2011

Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...

SIGACT

2010

12 years 8 months ago
2010

A fundamental question in complexity theory is whether every randomized polynomial time algorithm can be simulated by a deterministic polynomial time algorithm (that is, whether B...

DAGSTUHL

2007

12 years 11 months ago
2007

In this paper we give the ﬁrst deterministic polynomial time algorithm for testing whether a diagonal depth-3 circuit C(x1, . . . , xn) (i.e. C is a sum of powers of linear funct...

COCO

2008

Springer

12 years 11 months ago
2008

Springer

We study the average-case hardness of the class NP against deterministic polynomial time algorithms. We prove that there exists some constant

COCO

2004

Springer

13 years 2 months ago
2004

Springer

We give a deterministic polynomial time algorithm for polynomial identity testing in the following two cases:

PKC

2007

Springer

13 years 3 months ago
2007

Springer

Abstract. For RSA, May showed a deterministic polynomial time equivalence of computing d to factoring N(= pq). On the other hand, Takagi showed a variant of RSA such that the decry...

STOC

2002

ACM

13 years 9 months ago
2002

ACM

We study the average-case hardness of the class NP against deterministic polynomial time algorithms. We prove that there exists some constant ? > 0 such that if there is some l...