Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases

Author： Giesbrecht M. Kaltofen E. Lee W.-s.

Publisher： Elsevier

ISSN： 0747-7171

Source： Journal of Symbolic Computation, Vol.36, Iss.3, 2003-09, pp. : 401-424

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

-Automata and Chebyshev-polynomials

By Sutner K.

Theoretical Computer Science, Vol. 230, Iss. 1, 2000-01 ,pp. : 49-73

Elsevier

Access to resources Recommend Favorite

Parameter redundancy in neural networks: an application of Chebyshev polynomials

By Curry Bruce

Computational Management Science, Vol. 4, Iss. 3, 2007-07 ,pp. : 227-242

Springer Publishing Company

Access to resources Recommend Favorite

Heterogeneous Computing and Parallel Genetic Algorithms

By Alba E. Nebro A.J. Troya J.M.

Journal of Parallel and Distributed Computing, Vol. 62, Iss. 9, 2002-09 ,pp. : 1362-1385

Academic Press

Access to resources Recommend Favorite

Algorithms for Modular Counting of Roots of Multivariate Polynomials

By Gopalan Parikshit Guruswami Venkatesan Lipton Richard

Algorithmica, Vol. 50, Iss. 4, 2008-04 ,pp. : 479-496

Springer Publishing Company

Access to resources Recommend Favorite

Power Estimation Using Probability Polynomials

By Costa José Silveira Luis Devadas Srinivas Monteiro José

Design Automation for Embedded Systems, Vol. 9, Iss. 1, 2004-03 ,pp. : 19-52

Springer Publishing Company

Access to resources Recommend Favorite