where p is a positive integer, t<sub>i</sub>’s and s<sub>i</sub>’s are distinct points in the complex plane and t<sub>i</sub>≠s<sub>j</sub>, i,j=1, 2,…, n. The follo...where p is a positive integer, t<sub>i</sub>’s and s<sub>i</sub>’s are distinct points in the complex plane and t<sub>i</sub>≠s<sub>j</sub>, i,j=1, 2,…, n. The following question was considered in[1].Given a vector b. Does there exist an algorithm for computing the product B<sub>1</sub>b in less than O（n<sup>2</sup>） operations?'展开更多
文摘where p is a positive integer, t<sub>i</sub>’s and s<sub>i</sub>’s are distinct points in the complex plane and t<sub>i</sub>≠s<sub>j</sub>, i,j=1, 2,…, n. The following question was considered in[1].Given a vector b. Does there exist an algorithm for computing the product B<sub>1</sub>b in less than O（n<sup>2</sup>） operations?'
