Login / Signup

Coordinating Parallel Mobile Ambients to Solve SAT Problem in Polynomial Number of Steps.

Bogdan AmanGabriel Ciobanu
Published in: COORDINATION (2012)
Keyphrases
  • computational complexity
  • information retrieval
  • lower bound
  • search space
  • mobile devices
  • dynamic programming
  • sat problem
  • stochastic local search