Login / Signup

Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs.

Karl-Heinz NigglHenning Wunderlich
Published in: SIAM J. Comput. (2006)
Keyphrases
  • imperative programs
  • dynamic logic
  • closed form
  • linear space
  • computational complexity
  • relational databases
  • machine learning
  • search algorithm
  • special case
  • integrity constraints