Login / Signup

Acyclic orders, partition schemes and CSPs: Unified hardness proofs and improved algorithms.

Peter JonssonVictor LagerkvistGeorge Osipov
Published in: Artif. Intell. (2021)
Keyphrases
  • significant improvement
  • data structure
  • computational complexity
  • np hard
  • orders of magnitude
  • learning algorithm
  • np complete
  • decision trees
  • computational cost
  • worst case
  • computationally efficient