Satisfiability in many-valued sentential logic is NP-complete

  • Authors:
  • D. Mundici

  • Affiliations:
  • Univ. of Florence, Firenze, Italy

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 1987

Quantified Score

Hi-index 5.23

Visualization

Abstract