Pyae, Khaing Hsu; Tun, Khin Nwe Ni
(Fifth Local Conference on Parallel and Soft Computing, 2010-12-16)
Combinatorial problems are prominent in
Artificial Intelligent and Operation Research. They
can’t be solved in a given polynomial time with
deterministic algorithm, also known as NP complete.
Some researchers survey ...