Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size

Computer Science – Computational Complexity

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

12 pages

Scientific paper

The isolation lemma of Mulmuley et al \cite{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 \emph{deterministic} identity tests has received a lot of attention recently. The goal of this note is to compare the isolation lemma with polynomial identity testing: 1. We 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. The restricted versions of the isolation lemma we consider are natural and would suffice for the standard applications of the isolation lemma. 2. From the result of Klivans-Spielman \cite{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 also implies circuit size lower bounds in the commutative setting.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-729839

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.