• McEliece

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

• CABOB

• Referenced in 31 articles [sw17813]
• allocations, but determining the winners is NP-complete and inapproximable. We present CABOB, a sophisticated...

• Zchaff2004

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

• GRASP_QAP

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

• PARTY

• Referenced in 10 articles [sw20518]
• different measures is in most cases NP-complete. A large number of efficient partitioning heuristics...

• MicroEliece

• Referenced in 9 articles [sw09835]
• could render a large set of cryptosystems completely useless. The McEliece public-key scheme ... decoding unknown linear binary codes is NP-complete. In this work, we investigate the efficient...

• Fg-index

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

• FES

• Referenced in 5 articles [sw18532]
• constraint optimization problems proven to be NP-complete. Furthermore, evaluation of violations is costly...

• PySAT

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

• LIPSAT

• Referenced in 3 articles [sw28633]
• witnesses, placing LIPSAT complexity in the NP-complete class. An exact satisfiability decision algorithm ... 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]
• approach is wide (e.g., many NP-complete problems can be simply specified and then solved...

• ZENTURIO

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

• LVMSR

• Referenced in 2 articles [sw02374]
• computing such data distribution paths is NP-complete. This paper presents a new heuristic algorithm...

• ParTriCluster

• Referenced in 2 articles [sw09645]
• remains a bottleneck due to its NP-Completeness, so its parallelization seems...

• PMax

• Referenced in 2 articles [sw11226]
• company. We show that PMax is NP-complete. Therefore, we devise a meta-heuristic, called...

• S-Cluster++

• Referenced in 2 articles [sw29662]
• tree containment and CCP are NP-complete. Although the CCP was introduced a decade...

• DRSCRO

• Referenced in 1 article [sw25692]
• known to be NP-complete. A recently proposed metaheuristic method, Chemical Reaction Optimization (CRO), demonstrates ... capability for solving NP-complete optimization problems. This paper develops an algorithm named Double-Reaction...

• libiop

• Referenced in 1 article [sw31793]
• these zkSNARKs support R1CS (an NP-complete relation that generalizes arithmetic circuit satisfiability) over smooth...

• PMORSy

• Referenced in 1 article [sw20559]
• ordering on shared memory systems. The NP-complete fill-in minimization problem is solved...