Ciliberti; Mézard (Lossy Compression Data Compression): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == Constraint Satisfaction Problem with Random Gates == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 2005 == Reference == https://arxiv.org/abs/cond-mat/0504509") |
No edit summary |
||
| Line 5: | Line 5: | ||
== Space Complexity == | == Space Complexity == | ||
$O(n^{2})$? bits | |||
() | (Derived: size of the factor graph representation of the generator matrix, or size of the generator matrix itself) | ||
== Description == | == Description == | ||
| Line 23: | Line 23: | ||
== Model of Computation == | == Model of Computation == | ||
Word RAM | |||
== Year == | == Year == | ||
Latest revision as of 08:46, 10 April 2023
Time Complexity
$O(n^{2})$
Space Complexity
$O(n^{2})$? bits
(Derived: size of the factor graph representation of the generator matrix, or size of the generator matrix itself)
Description
Constraint Satisfaction Problem with Random Gates
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2005