A Comparison of Algorithms for the Normalization and Quantization of Polynomial Hamiltonians

Author： Gusev A. A.   Chekanov N. A.   Rostovtsev V. A.   Vinitsky S. I.   Uwano Y.  

Publisher： MAIK Nauka/Interperiodica

ISSN： 0361-7688

Source： Programming and Computer Software, Vol.30, Iss.2, 2004-03, pp. : 75-82

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

A polynomial -bisimilar normalization for reset Petri nets

By Dufourd C.   Finkel A.  

Theoretical Computer Science, Vol. 222, Iss. 1, 1999-07 ,pp. : 187-194

Elsevier

Access to resources Recommend Favorite

Stability of parallel algorithms for polynomial evaluation

By Barrio R.   Yalamov P.  

Computers and Mathematics with Applications, Vol. 46, Iss. 5, 2003-09 ,pp. : 769-781

Elsevier

Access to resources Recommend Favorite

Fast Vector Quantization Encoding Algorithms for Image Compression

By  

International Journal of Mobile Computing and Multimedia Communications (IJMCMC), Vol. 1, Iss. 1, 2009-01 ,pp. : 16-28

IGI Global_journal

Access to resources Recommend Favorite

Parallel algorithms for finding polynomial Roots on OTIS-torus

By Lucas Keny   Jana Prasanta  

The Journal of Supercomputing, Vol. 54, Iss. 2, 2010-11 ,pp. : 139-153

Springer Publishing Company

Access to resources Recommend Favorite

Polynomial-Time Decomposition Algorithms for Support Vector Machines

By Hush D.  

Machine Learning, Vol. 51, Iss. 1, 2003-04 ,pp. : 51-71

Springer Publishing Company

Access to resources Recommend Favorite