Subquadratic Computation of Vector Generating Polynomials and Improvement of the Block Wiedemann Algorithm

ISSN： 0747-7171

Source： Journal of Symbolic Computation, Vol.33, Iss.5, 2002-05, pp. : 757-775

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

Galois Group Computation for Rational Polynomials

By Geissler K. Klüners J.

Journal of Symbolic Computation, Vol. 30, Iss. 6, 2000-12 ,pp. : 653-674

Academic Press

Access to resources Recommend Favorite

Feature Ranking Computation Algorithm

International Journal of Organizational and Collective Intelligence (IJOCI), Vol. 3, Iss. 3, 2012-07 ,pp. : 1-21

IGI Global_journal

Access to resources Recommend Favorite

Algorithms and analyses for maximal vector computation

By Godfrey Parke

The VLDB Journal, Vol. 16, Iss. 1, 2007-01 ,pp. : 5-28

Springer Publishing Company

Access to resources Recommend Favorite

A Sequential Algorithm for Generating Random Graphs

By Bayati Mohsen Kim Jeong Saberi Amin

Algorithmica, Vol. 58, Iss. 4, 2010-12 ,pp. : 860-910

Springer Publishing Company

Access to resources Recommend Favorite

A posteriori iron loss computation with a vector hysteresis model

By Belahcen A. Dlala E. Fonteyn K. Belkasim M.

COMPEL: Int J for Computation and Maths. in Electrical and Electronic Eng., Vol. 29, Iss. 6, 2010-11 ,pp. : 1493-1503

Emerald Group Publishing Ltd

Access to resources Recommend Favorite