๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The computational complexity of knot and link problems

โœ Scribed by Hass, Joel; Lagarias, Jeffrey C.; Pippenger, Nicholas


Book ID
115538177
Publisher
Association for Computing Machinery
Year
1999
Tongue
English
Weight
185 KB
Volume
46
Category
Article
ISSN
0004-5411

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Computational Complexity of Holant Probl
โœ Cai, Jin-Yi; Lu, Pinyan; Xia, Mingji ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 517 KB