Self-testing/correcting for polynomials and for approximate functions
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
A note on enumerative counting
Information Processing Letters
On the hardness of computing the permanent of random matrices (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Highly resilient correctors for polynomials
Information Processing Letters
Randomized algorithms
Polynomial Factorization 1987-1991
LATIN '92 Proceedings of the 1st Latin American Symposium on Theoretical Informatics
Randomness vs. Time: De-Randomization under a Uniform Assumption
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Maximum likelihood decoding of Reed Solomon codes
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
On the computational power of PP and (+)P
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Algebraic methods for interactive proof systems
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Reconstructing algebraic functions from mixed data
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Pseudorandom generators without the XOR Lemma (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
List Decoding: Algorithms and Applications
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Polynomial Reconstruction Based Cryptography
SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
On the hardness of approximating the permanent of structured matrices
Computational Complexity
Average-case intractability vs. worst-case intractability
Information and Computation
Using nondeterminism to amplify hardness
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
On the cost-ineffectiveness of redundancy in commercial P2P computing
Proceedings of the 12th ACM conference on Computer and communications security
Special Issue On Worst-case Versus Average-case Complexity Editors' Foreword
Computational Complexity
Pseudorandomness and Average-Case Complexity Via Uniform Reductions
Computational Complexity
Hardness amplification proofs require majority
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
SIGACT news complexity theory column 64
ACM SIGACT News
Hardness Amplification Proofs Require Majority
SIAM Journal on Computing
k-Concealment: An Alternative Model of k-Type Anonymity
Transactions on Data Privacy
| Hi-index | 0.00 |
We prove that if there is a polynomial time algorithm which computes the permanent of a matrix of order n for any inverse polynomial fraction of all inputs, then there is a BPP algorithm computing the permanent for every matrix. It follows that this hypothesis implies P #P = BPP. Our algorithm works over any sufficiently large finite field (polynomially larger than the inverse of the assumed success ratio), or any interval of integers of similar range. The assumed algorithm can also be a probabilistic polynomial time algorithm. Our result is essentially the best possible based on any black box assumption of permanent solvers, and is a simultaneous improvement of the results of Gemmell and Sudan [GS92], Feige and Lund [FL92] as well as Cai and Hemachandra [CH91], and Toda (see [ABG90]).