Login / Signup

Formal proof of polynomial-time complexity with quasi-interpretations.

Hugo FéréeSamuel HymMicaela MayeroJean-Yves MoyenDavid 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