×
+ All Categories
Log in
English
Français
Español
Deutsch
The top documents tagged [result fast slide]
Home >
result fast slide
Fall 2004COMP 3351 Time Complexity We use a multitape Turing machine We count the number of steps until a string is accepted We use the O(k) notation.
217 views