Brute force (Lossy Compression Data Compression)

From Algorithm Wiki

Revision as of 08:46, 10 April 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

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

Reference

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Brute_force_(Lossy_Compression_Data_Compression)&oldid=47459"