Login / Signup

Undecidable Goals for Completed Acyclic Programs.

Marc BezemJan Keuzenkamp
Published in: New Gener. Comput. (1994)
Keyphrases
  • np complete
  • np hard
  • sufficient conditions
  • computer programs
  • fixpoint
  • database schemes
  • conp complete
  • computational complexity
  • data sets
  • special case
  • programming environment