The parametrized complexity of knot polynomials

Author： Makowsky J.A.   Marino J.P.  

Publisher： Elsevier

ISSN： 0022-0000

Source： Journal of Computer and System Sciences, Vol.67, Iss.4, 2003-12, pp. : 742-756

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

Related content

Surfaces parametrized by the normals

By Gravesen J.  

Computing, Vol. 79, Iss. 2-4, 2007-04 ,pp. : 175-183

Springer Publishing Company

Access to resources Recommend Favorite

Conjoint Analysis of Parametrized Gamut Mapping Algorithms

By Barańczuk Zofia   Sprow Iris   Zolliker Peter   Giesen Joachim  

Color and Imaging Conference, Vol. 2008, Iss. 1, 2008-01 ,pp. : 38-43

Society for Imaging Science and Technology

Access to resources Recommend Favorite

The complexity of measuring complexity

By Tarride Mario Iván  

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 42, Iss. 2, 2013-02 ,pp. : 174-184

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

Real-time knot-tying simulation

By Brown Joel  

The Visual Computer, Vol. 20, Iss. 2-3, 2004-05 ,pp. : 165-179

Springer Publishing Company

Access to resources Recommend Favorite

A new definition of the Adomian polynomials

By Rach Randolph C.  

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 37, Iss. 7, 2008-09 ,pp. : 910-955

Emerald Group Publishing Ltd

Access to resources Recommend Favorite