Login / Signup

Succinctness and tractability of closure operator representations.

Sebastian Rudolph
Published in: Theor. Comput. Sci. (2017)
Keyphrases
  • closure operator
  • computational complexity
  • modal logic
  • np complete
  • mining algorithm
  • closed sets
  • fixed point
  • data sets
  • bayesian networks
  • multi dimensional