1 citations · 2 across the 2 of their papers we have counts for
1 paper · 1 filter
Saeid Parvandeh, Parya Soltani, Mohammadreza Boroumand +1
Non-polynomial hard (NP-hard) problems are challenging because no polynomial-time algorithm has yet been discovered to solve them in polynomial time. The Bacteria Foraging Optimiza…