A Note on the Complexity of the Transpose of a Matrix

Forfattere

  • Philip Matthews
  • Carl Sturtivant

DOI:

https://doi.org/10.7146/dpb.v17i265.7619

Resumé

Let x be a column vector of indeterminates. We show that the complexity of computing the linear forms Ax for a fixed matrix A is essentially the same as that of computing the linear forms A'x where the prime denotes transpose. Our result also holds for non-square matrices, under a simple restriction.

Forfatterbiografier

Philip Matthews

Carl Sturtivant

Downloads

Publiceret

1988-09-01

Citation/Eksport

Matthews, P., & Sturtivant, C. (1988). A Note on the Complexity of the Transpose of a Matrix. DAIMI Report Series, 17(265). https://doi.org/10.7146/dpb.v17i265.7619