The polynomial method in circuit complexity

Richard Beigel

2002 · 165 citations · 48 references

Concepts

Abstract

The basic techniques for using polynomials in complexity theory are examined, emphasizing intuition at the expense of formality. The focus is on the connections to constant-depth circuits, at the expense of polynomial-time Turing machines. The closure properties, upper bounds, and lower bounds obtained by this approach are surveyed.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

References

48