Computational complexity of classes of learning problems depends on which of the following?
Answers
Answered by
0
Hi there,
Computational complexity of classes of learning problems depends on the size or complexity of the hypothesis space considered by learner.
I hope the answer is satisfactory. Thanks
Answered by
0
Computational complexity theory is an area of computation in computer science that aims on divisioning computational problems according to their inherent difficulty, and relating the resulting complexity classes to each other.A computational problem is regarded to be a work that is in principle amenable to being solved by mechanical application.
Similar questions