Sciweavers

ECCC
2011
223views ECommerce» more  ECCC 2011»
13 years 1 months ago
A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
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 ...
Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
SIGACT
2010
74views more  SIGACT 2010»
13 years 4 months ago
Typically-correct derandomization
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...
Ronen Shaltiel
DAGSTUHL
2007
13 years 7 months ago
Diagonal Circuit Identity Testing and Lower Bounds
In this paper we give the first 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...
Nitin Saxena
COCO
2008
Springer
95views Algorithms» more  COCO 2008»
13 years 8 months ago
Hardness Amplification within NP against Deterministic Algorithms
We study the average-case hardness of the class NP against deterministic polynomial time algorithms. We prove that there exists some constant
Parikshit Gopalan, Venkatesan Guruswami
COCO
2004
Springer
86views Algorithms» more  COCO 2004»
13 years 11 months ago
Deterministic Polynomial Identity Testing in Non-Commutative Models
We give a deterministic polynomial time algorithm for polynomial identity testing in the following two cases:
Ran Raz, Amir Shpilka
PKC
2007
Springer
165views Cryptology» more  PKC 2007»
14 years 14 days ago
Deterministic Polynomial Time Equivalence Between Factoring and Key-Recovery Attack on Takagi's RSA
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...
Noboru Kunihiro, Kaoru Kurosawa
STOC
2002
ACM
117views Algorithms» more  STOC 2002»
14 years 6 months ago
Hardness amplification within NP
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...
Ryan O'Donnell