Login / Signup

Using an unrank framework to solve small instances of NP-hard problems on graphical processing units.

Nicholas VogelColin UhenZachary BurnsideSergio BoteroChristian TrefftzGregory Wolffe
Published in: EIT (2014)
Keyphrases
  • processing units
  • np hard problems
  • special case
  • np complete
  • constraint programming