Michael Forbes

Learn More
Research in the last decade has shown that to prove lower bounds or to derandomize polynomial identity testing (PIT) for general arithmetic circuits it suffices to solve these questions for restricted circuits. In this work, we study the smallest possibly restricted class of circuits, in particular depth-4 circuits, which would yield such results for(More)
Research in the last decade has shown that to prove lower bounds or to derandomize polynomial identity testing (PIT) it suffices to solve these questions for restricted circuits. In this work, we study the possibly most restricted class of circuits, within depth-4, which would yield such results for general circuits (that is, the complexity class VP). We(More)
  • 1