• McEliece

  • Referenced in 250 articles [sw02076]
  • unknown linear binary codes is an NP-complete problem. The interest on implementing post-quantum...
  • Zchaff2004

  • Referenced in 21 articles [sw01032]
  • Problem (SAT) is a well known NP-complete problem. While its complexity remains a source...
  • PySAT

  • Referenced in 18 articles [sw25459]
  • practical problems. Moreover, albeit targeting an NP-complete problem, SAT solvers are increasingly used...
  • GRASP_QAP

  • Referenced in 17 articles [sw04684]
  • problems using GRASP. In the NP-complete quadratic assignment problem (QAP), n facilities...
  • Fg-index

  • Referenced in 9 articles [sw18892]
  • subgraph isomorphism testing, which is an NP-complete problem. In recent years, some effective graph...
  • LIPSAT

  • Referenced in 6 articles [sw28633]
  • witnesses, placing LIPSAT complexity in the NP-complete class. An exact satisfiability decision algorithm ... which employs, as a subroutine, the decision problem for Łukasiewicz infinitely-valued ... probabilistic) logic, that is also an NP-complete problem. We develop implementations of the algorithms...
  • GenPSAT

  • Referenced in 4 articles [sw24009]
  • GenPSAT is proved to be {ssf NP}-complete and we present a polynomial reduction ... previously observed for many other NP-complete problems, we are able to detect a phase...
  • URSA

  • Referenced in 4 articles [sw15541]
  • uniform solving of a wide class of problems by reducing them to SAT. The system ... approach is wide (e.g., many NP-complete problems can be simply specified and then solved...
  • CABOB

  • Referenced in 31 articles [sw17813]
  • NP-complete and inapproximable. We present CABOB, a sophisticated optimal search algorithm for the problem...
  • FES

  • Referenced in 5 articles [sw18532]
  • problems are constraint optimization problems proven to be NP-complete. Furthermore, evaluation of violations ... common data format for representing timetabling problem instances. In this paper, a framework for designing...
  • ZENTURIO

  • Referenced in 3 articles [sw02487]
  • generic framework for solving NP-complete optimisation problems for parallel and grid applications. We present...
  • NLocalSAT

  • Referenced in 1 article [sw40123]
  • satisfiability problem (SAT) is a famous NP-complete problem in computer science. An effective...
  • CartoDraw

  • Referenced in 6 articles [sw38943]
  • formally define a family of cartogram drawing problems. We show that even simple variants ... feasible variants are NP-complete, heuristics are needed to solve the problem. Previously proposed solutions...
  • MuRoCo

  • Referenced in 1 article [sw06548]
  • robots, known as multi-robot task allocation problem. In case the tasks require a tight ... which is known to be a NP-complete problem. Here the MuRoCo framework is presented...
  • PAxML

  • Referenced in 1 article [sw06653]
  • SR8000-F1 supercomputer Heuristics for the NP-complete problem of calculating the optimal phylogenetic tree...
  • KnotSeeker

  • Referenced in 1 article [sw36931]
  • prediction of pseudoknots is an NP-complete problem. Practical structure prediction algorithms based on free...
  • MPLMR

  • Referenced in 1 article [sw07627]
  • Unfortunately, the multiconstraint QoS routing problem is NP-complete. In this paper, we propose...
  • DRSCRO

  • Referenced in 1 article [sw25692]
  • demonstrates its capability for solving NP-complete optimization problems. This paper develops an algorithm named...
  • PARTY

  • Referenced in 10 articles [sw20518]
  • PARTY: The problem of partitioning a graph into a number of pieces ... different measures is in most cases NP-complete. A large number of efficient partitioning heuristics ... certain implementation details. Fortunately, the partitioning problem itself is clearly defined and its description leads...