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
• DOI: 10.1016/0004-3702(85)90041-4