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

  • Authors:
  • Alan K. Mackworth;Eugene C. Freuder

  • Affiliations:
  • Univ. of British Columbia, Vancouver, B.C., Canada;Univ. of New Hampshire, Durham

  • Venue:
  • Artificial Intelligence
  • Year:
  • 1985

Quantified Score

Hi-index 0.00

Visualization

Abstract