-
-
Notifications
You must be signed in to change notification settings - Fork 0
complexity theory
Urban Cowboy edited this page Nov 20, 2018
·
1 revision
Wanta to analyze how complexity increases with the number of n
In directed, cyclic graphs, complexity increases on the order of 2^4n. For DAGs, it is around 2^3n.
Singularity