Foundations and Trends® in Theoretical Computer Science >
Vol 5 > Issue 3–4

Amir Shpilka and Amir Yehudayoff (2010), "Arithmetic Circuits: A Survey of Recent Results and Open Questions", Foundations and Trends® in Theoretical Computer Science: Vol. 5: No. 3–4, pp 207-388. http://dx.doi.org/10.1561/0400000039

© 2010 A. Shpilka and A. Yehudayoff

Download article
**In this article:**

1 Introduction

2 Structural Results

3 Lower Bounds

4 Polynomial Identity Testing

5 Reconstruction of Arithmetic Circuits

Acknowledgments

References

A large class of problems in symbolic computation can be expressed as the task of computing some polynomials; and arithmetic circuits form the most standard model for studying the complexity of such computations. This algebraic model of computation attracted a large amount of research in the last five decades, partially due to its simplicity and elegance. Being a more structured model than Boolean circuits, one could hope that the fundamental problems of theoretical computer science, such as separating P from NP, will be easier to solve for arithmetic circuits. However, in spite of the appearing simplicity and the vast amount of mathematical tools available, no major breakthrough has been seen. In fact, all the fundamental questions are still open for this model as well. Nevertheless, there has been a lot of progress in the area and beautiful results have been found, some in the last few years. As examples we mention the connection between polynomial identity testing and lower bounds of Kabanets and Impagliazzo, the lower bounds of Raz for multilinear formulas, and two new approaches for proving lower bounds: Geometric Complexity Theory and Elusive Functions.

The goal of this monograph is to survey the field of arithmetic circuit complexity, focusing mainly on what we find to be the most interesting and accessible research directions. We aim to cover the main results and techniques, with an emphasis on works from the last two decades. In particular, we discuss the recent lower bounds for multilinear circuits and formulas, the advances in the question of deterministically checking polynomial identities, and the results regarding reconstruction of arithmetic circuits. We do, however, also cover part of the classical works on arithmetic circuits. In order to keep this monograph at a reasonable length, we do not give full proofs of most theorems, but rather try to convey the main ideas behind each proof and demonstrate it, where possible, by proving some special cases.

1: Introduction

2: Structural results

3: Lower bounds

4: Polynomial Identity Testing

5: Reconstruction of arithmetic circuits

Acknowledgements

References

Algebraic complexity theory studies the inherent difficulty of algebraic problems by quantifying the minimal amount of resources required to solve them. The most fundamental questions in algebraic complexity are related to the complexity of arithmetic circuits: providing efficient algorithms for algebraic problems, proving lower bounds on the size and depth of arithmetic circuits, giving efficient deterministic algorithms for polynomial identity testing, and finding efficient reconstruction algorithms for polynomials computed by arithmetic circuits. Arithmetic Circuits: A Survey of Recent Results and Open Questions surveys the field of arithmetic circuit complexity. It covers the main results and techniques in the area, with an emphasis on works from the last two decades. In particular, it discusses the classical structural results including $\mathsf{VP}=\mathsf{VNC}^2$ and the recent developments highlighting the importance of depth-$4$ circuits, the classical lower bounds of Strassen and Baur-Strassen and the recent lower bounds for multilinear circuits and formulas, the advances made in the area of deterministically checking polynomial identities and the results regarding reconstruction of arithmetic circuits. It also presents many open questions that may be considered as natural "next steps" given the current state of knowledge.