Login / Signup

All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size.

Florin ManeaVictor Mitrana
Published in: Inf. Process. Lett. (2007)
Keyphrases
  • computational complexity
  • np complete
  • special case
  • optimization problems
  • decision problems
  • np hard
  • real time
  • benchmark problems
  • combinatorial problems
  • np hardness
  • computationally challenging
  • min sum