NP is as easy as detecting unique solutions
Theoretical Computer Science
Lower bounds for non-commutative computation
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Finite automata, formal logic, and circuit complexity
Finite automata, formal logic, and circuit complexity
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
Isolation, matching and counting uniform and nonuniform upper bounds
Journal of Computer and System Sciences
Making Nondeterminism Unambiguous
SIAM Journal on Computing
Randomness efficient identity testing of multivariate polynomials
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Matching is as easy as matrix inversion
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
In search of an easy witness: exponential time vs. probabilistic polynomial time
Journal of Computer and System Sciences - Complexity 2001
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
Deterministic polynomial identity testing in non-commutative models
Computational Complexity
More on Noncommutative Polynomial Identity Testing
CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
Algebras with Polynomial Identities and Computing the Determinant
SIAM Journal on Computing
New Results on Noncommutative and Commutative Polynomial Identity Testing
CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
Proving lower bounds via pseudo-random generators
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
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
Deterministic algorithms for multi-criteria TSP
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Recent results on polynomial identity testing
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Space complexity of perfect matching in bounded genus bipartite graphs
Journal of Computer and System Sciences
Green's theorem and isolation in planar graphs
Information and Computation
Deterministic algorithms for multi-criteria Max-TSP
Discrete Applied Mathematics
Revisiting the equivalence problem for finite multitape automata
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Dynamic programming for graphs on surfaces
ACM Transactions on Algorithms (TALG)
Hi-index | 0.00 |
The isolation lemma of Mulmuley et al [MVV87] is an important tool in the design of randomized algorithms and has played an important role in several nontrivial complexity upper bounds. On the other hand, polynomial identity testing is a well-studied algorithmic problem with efficient randomized algorithms and the problem of obtaining efficient deterministicidentity tests has received a lot of attention recently. The goal of this paper is to compare the isolation lemma with polynomial identity testing:1We show that derandomizing reasonably restricted versions of the isolation lemma implies circuit size lower bounds. We derive the circuit lower bounds by examining the connection between the isolation lemma and polynomial identity testing. We give a randomized polynomial-time identity test for noncommutative circuits of polynomial degree based on the isolation lemma. Using this result, we show that derandomizing the isolation lemma implies noncommutative circuit size lower bounds. For the commutative case, a stronger derandomization hypothesis allows us to construct an explicit multilinear polynomial that does not have subexponential size commutative circuits. The restricted versions of the isolation lemma we consider are natural and would suffice for the standard applications of the isolation lemma.1From the result of Klivans-Spielman [KS01] we observe that there is a randomized polynomial-time identity test for commutative circuits of polynomial degree, also based on a more general isolation lemma for linear forms. Consequently, derandomization of (a suitable version of) this isolation lemma implies that either or the Permanent over does not have polynomial-size arithmetic circuits.