Unibo AI
Search
Ctrl
+
K
Unibo AI
Search
Ctrl
+
K
complexity
Asymptotic Notation
Binary encoding
Computability and Complexity
Part 1
Polynomial
Uncomputability
already known NP-complete problem
Certificate
Class EXP
Class P
Complexity class
Consistent learning algorithms
Courses
Deterministic TM
Efficiently PAC Learnablity
exponential
Learning Algorithms
Nondeterministic Turing Machine
NP-complete
NP-hard
NP
PAC Learnablity
Part 2
Part 3
Part 4
Part 5
Reduction
Rice Theorem
Semantic languages
Trivial languages
Turing machine
VC Dimension
Complexity class
A set of
Tasks/Problems
that can be computed using the similar resource bound.
NOT a set of algorithms! a set of problems.
Enter your search text in the box above
Select a result to preview
Powered by Forestry.md