A computational complexity analysis of tunable type inference for Generic Universe Types.
Nahid JumaWerner DietlMahesh TripunitaraPublished in: Theor. Comput. Sci. (2020)
Keyphrases
- complexity analysis
- theoretical analysis
- lower bound
- multiple types
- probabilistic inference
- first order logic
- inference process
- artificial intelligence
- bayesian inference
- information systems
- computational complexity
- neural network
- domain specific
- scheduling problem
- mathematical programming
- rough sets
- special case
- database systems
- decision trees
- information retrieval
- data mining