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

The complexity of some polynomial network consistency algorithms for constraint satisfaction problems

โœ Scribed by Alan K. Mackworth; Eugene C. Freuder


Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
475 KB
Volume
25
Category
Article
ISSN
0004-3702

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES