Complete Problems for Valiant's Class of qp-Computable Families of Polynomials

Authors:
Markus Bläser
Affiliations:
-
Venue:
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Year:
2001

Citing 6
Cited 1

A taxonomy of problems with fast parallel algorithms

Information and Control
Feasible arithmetic computations: Valiant's hypothesis

Journal of Symbolic Computation
Efficient parallel evaluation of straight-line code and arithmetic circuits

SIAM Journal on Computing
Computing algebraic formulas using a constant number of registers

SIAM Journal on Computing
Completeness classes in algebra

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Algebraic Complexity Theory

Algebraic Complexity Theory

Characterizing valiant's algebraic complexity classes

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove that the families matrix powering, iterated matrix product, and adjoint matrix are VQP-complete, where VQP denotes Valiant's class of quasipolynomial-computable families of multivariate polynomials. This proves a conjecture by Bürgisser [3, Conjecture 8.1].