1 citations · 1 across the 1 of their papers we have counts for
1 paper
Ramin Maazallahi, Aliakbar Niknafs
Although it has been evidenced that DNA computing is able to solve the graph coloring problem in a polynomial time complexity, but the exponential solution space is still a restric…