Login / Signup

Checking quasi-identities in a finite semigroup may be computationally hard.

Mikhail V. Volkov
Published in: Stud Logica (2004)
Keyphrases
  • computationally hard
  • np hard
  • efficiently computable
  • single peaked
  • genetic algorithm
  • bayesian networks