An efficient algorithm for the multiple constant multiplication problem
碩士 === 國立交通大學 === 電子工程學系 === 85 === In this thesis, we propose an efficient solution for the multiple constant multiplication (MCM) problem. Regarding the matrix as a spring , the algorithm aims at adjusting the spring into its most rela...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
1997
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/68702215048818524094 |
Search Result 1
