Login / Signup
Strong Invariants Are Hard: On the Hardness of Strongest Polynomial Invariants for (Probabilistic) Programs.
Julian Müllner
Marcel Moosbrugger
Laura Kovács
Published in:
CoRR (2023)
Keyphrases
</>
imperative programs
affine invariant
moment invariants
information theoretic
uncertain data
implicit polynomial
data sets
np complete
genetic algorithm
bayesian networks
image registration
data driven
projective invariants