Login / Signup
Formal proof of polynomial-time complexity with quasi-interpretations.
Hugo Férée
Samuel Hym
Micaela Mayero
Jean-Yves Moyen
David Nowak
Published in:
CPP (2018)
Keyphrases
</>
formal proof
polynomial time complexity
np complete
theorem prover
min cut max flow
data sets
np hard
multiple interpretations
artificial intelligence
computer vision
special case
image reconstruction