How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
Small-bias probability spaces: efficient constructions and applications
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Journal of Computer and System Sciences
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
P = BPP if E requires exponential circuits: derandomizing the XOR lemma
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A Pseudorandom Generator from any One-way Function
SIAM Journal on Computing
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
Time—space tradeoffs for satisfiability
Journal of Computer and System Sciences - Eleventh annual conference on computational learning theory&slash;Twelfth Annual IEEE conference on computational complexity
Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems
SIAM Journal on Computing
Probabilistic algorithms for sparse polynomials
EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
Derandomizing polynomial identity tests means proving circuit lower bounds
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Undirected ST-connectivity in log-space
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Simple construction of almost k-wise independent random variables
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
A quadratic lower bound for the permanent and determinant problem over any characteristic ≠ 2
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Read-once polynomial identity testing
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Hardness-randomness tradeoffs for bounded depth arithmetic circuits
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Deterministically testing sparse polynomial identities of unbounded degree
Information Processing Letters
Improved Polynomial Identity Testing for Read-Once Formulas
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in
Proceedings of the forty-second ACM symposium on Theory of computing
Cracks in the defenses: scouting out approaches on circuit lower bounds
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
On the relation between polynomial identity testing and finding variable disjoint factors
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Arithmetic Circuits: A survey of recent results and open questions
Foundations and Trends® in Theoretical Computer Science
On P vs. NP and geometric complexity theory: Dedicated to Sri Ramakrishna
Journal of the ACM (JACM)
Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter
Proceedings of the forty-third annual ACM symposium on Theory of computing
On the arithmetic complexity of euler function
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Recent results on polynomial identity testing
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Permanent does not have succinct polynomial size arithmetic circuits of constant depth
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Algebraic independence and blackbox identity testing
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
An Almost Optimal Rank Bound for Depth-3 Identities
SIAM Journal on Computing
Marginal hitting sets imply super-polynomial lower bounds for permanent
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
The GCT program toward the P vs. NP problem
Communications of the ACM
On identity testing of tensors, low-rank recovery and compressed sensing
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Reconstruction of depth-4 multilinear circuits with top fan-in 2
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Information Processing Letters
Algebraic independence and blackbox identity testing
Information and Computation
Permanent does not have succinct polynomial size arithmetic circuits of constant depth
Information and Computation
| Hi-index | 0.02 |
In this paper, we formalize two stepwise approaches, based on pseudo-random generators, for proving P≠NP and its arithmetic analog: Permanent requires superpolynomial sized arithmetic circuits.