Login / Signup

Strong Invariants Are Hard: On the Hardness of Strongest Polynomial Invariants for (Probabilistic) Programs.

Julian MüllnerMarcel MoosbruggerLaura Kovács
Published in: Proc. ACM Program. Lang. (2024)
Keyphrases
  • np hard
  • imperative programs
  • moment invariants
  • quasi invariant
  • probabilistic model
  • bayesian networks
  • affine invariant
  • invariant features
  • high level
  • information theoretic
  • projective invariants