How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
How hard is it to marry at random? (On the approximation of the permanent)
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
NP is as easy as detecting unique solutions
Theoretical Computer Science
Trading group theory for randomness
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Does co-NP have short interactive proofs?
Information Processing Letters
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
A hard-core predicate for all one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
SIAM Journal on Computing
Hiding instances in multioracle queries
STACS 90 Proceedings of the seventh annual symposium on Theoretical aspects of computer science
The discrete log is very discreet
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
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
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
The complexity of approximate counting
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Polynomial Reconstruction Based Cryptography
SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
Average-case intractability vs. worst-case intractability
Information and Computation
SIGACT news complexity theory column 64
ACM SIGACT News
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Relations between average-case and worst-case complexity
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
k-Concealment: An Alternative Model of k-Type Anonymity
Transactions on Data Privacy
Hi-index | 0.00 |
We study the complexity of computing the permanent on random inputs. We consider matrices drawn randomly from the space of n by n matrices with integer values between 0 and p–1, for any large enough prime p. We show that any polynomial time algorithm which computes the permanent correctly on even an exponentially small fraction of these matrices, implies the collapse of the polynomial-time hierarchy to its second level.We also show that it is hard to get partial information about the value of the permanent modulo p. We show that any balanced polynomial-time 0/1 predicate (e.g., the least significant bit, the parity of all the bits, the quadratic residuosity character) cannot be guessed with probability significantly greater than 1/2 (unless the polynomial hierarchy collapses). This result can be extended to showing simultaneous hardness for linear size groups of bits.