Name
Abstract | ||
|---|---|---|
Valiant introduced 20 years ago a theory to study the complexity of polynomial families. Using arithmetic circuits as computation model, these classes are easy to define and open to combinatorial techniques. In this paper we gather old and new results under a unifying theme, namely the restrictions imposed upon the gates, building a hierarchy from formulas to circuits. As a consequence we get simpler proofs for known results such as the equality of the classes VNP and VNPe or the completeness of the determinant for VQP, and new results such as a characterization of the class VP or answers to both a conjecture and a problem raised by Bürgisser [1]. We also show that for circuits of polynomial depth and unbounded size these models have the same expressive power and characterize a uniform version of VNP. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/11821069_61 | J. Complexity |
Keywords | DocType | Volume |
determinant,permanent,polynomials,expressive power | Journal | 24 |
Issue | ISSN | ISBN |
1 | 0302-9743 | 3-540-37791-3 |
Citations | PageRank | References |
21 | 1.14 | 20 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Guillaume Malod | 1 | 54 | 4.53 |
| Natacha Portier | 2 | 96 | 11.49 |