View source for Shi 2009 (NAE 3SAT Boolean Satisfiability)

== 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/stamp/stamp.jsp?tp=&arnumber=5211463)

== Description == 



== Approximate? == 

Exact

== Randomized? == 

No, deterministic

== Model of Computation == 

Adelman-Lipton

== Year == 

2009

== Reference == 

https://ieeexplore.ieee.org/abstract/document/5211463