Brute force (Lossy Compression Data Compression): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(n*{2}^n)$ == Space Complexity == () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1940 == Reference ==") |
No edit summary |
||
| Line 5: | Line 5: | ||
== Space Complexity == | == Space Complexity == | ||
$O(n*{2}^n)$? words | |||
() | (Keep track of big codebook?) | ||
== Description == | == Description == | ||
Brute Force | |||
== Approximate? == | == Approximate? == | ||
| Line 23: | Line 23: | ||
== Model of Computation == | == Model of Computation == | ||
Word RAM | |||
== Year == | == Year == | ||
Latest revision as of 09:46, 10 April 2023
Time Complexity
$O(n*{2}^n)$
Space Complexity
$O(n*{2}^n)$? words
(Keep track of big codebook?)
Description
Brute Force
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1940