Ciliberti; Mézard (Lossy Compression Data Compression)

From Algorithm Wiki
Revision as of 11:53, 15 February 2023 by Admin (talk | contribs) (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")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Ciliberti;_Mézard_(Lossy_Compression_Data_Compression)&oldid=44893"