DocumentCode
2178603
Title
The power of commutativity
Author
Hyafil, Laurent
fYear
1977
fDate
Oct. 31 1977-Nov. 2 1977
Firstpage
171
Lastpage
174
Abstract
In this paper we show that the computation of the determinant requires an exponential number of multiplications if the commutativity of indeterminates is not allowed. The determinant can be computed in polynomial time with the commutation of indeterminates. Hence the use of commutativity can reduce a computation of exponential complexity to a computation of polynomial complexity.
Keywords
Polynomials; Tensile stress;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 1977., 18th Annual Symposium on
Conference_Location
Providence, RI, USA
ISSN
0272-5428
Type
conf
DOI
10.1109/SFCS.1977.31
Filename
4567939
Link To Document