Type Inference with Simple Selftypes is NP-complete.

Jens Palsberg Trevor Jim

Published in: Nord. J. Comput. (1997)

Keyphrases

np complete
computational complexity
database
bayesian networks
constraint satisfaction problems
randomly generated
information systems
website
image sequences
satisfiability problem
multiple types
polynomial time complexity