𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The complexity of some polynomial network consistency algorithms for constraint satisfaction problems: A.K. Mackworth and E.C. Freuder [Artificial Intelligence 25 (1) (1985) 65–74]


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

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES