Shi 2009 (NAE 3SAT Boolean Satisfiability)

From Algorithm Wiki
Revision as of 11:18, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O({12}m*t_extract + {2}m*t_discard + {2}n*t_append + (n+{2}m)$*t_merge + (n-{1})*t_amplify) == Space Complexity == $O(n)$ tubes or $O({2}^n)$ library strands (https://ieeexplore-ieee-org.ezproxy.canberra.edu.au/stamp/stamp.jsp?tp=&arnumber=5211463) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Adelman-Lipton == Year == 2009 == Reference == https://ieeexplore-ieee-org.ezproxy.canberra.edu.au/abstract/document/52...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O({12}m*t_extract + {2}m*t_discard + {2}n*t_append + (n+{2}m)$*t_merge + (n-{1})*t_amplify)

Space Complexity

$O(n)$ tubes or $O({2}^n)$ library strands

(https://ieeexplore-ieee-org.ezproxy.canberra.edu.au/stamp/stamp.jsp?tp=&arnumber=5211463)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Adelman-Lipton

Year

2009

Reference

https://ieeexplore-ieee-org.ezproxy.canberra.edu.au/abstract/document/5211463

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Shi_2009_(NAE_3SAT_Boolean_Satisfiability)&oldid=45630"