
McEliece
 Referenced in 232 articles
[sw02076]
 unknown linear binary codes is an NPcomplete problem. The interest on implementing postquantum...

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

Zchaff2004
 Referenced in 21 articles
[sw01032]
 Problem (SAT) is a well known NPcomplete problem. While its complexity remains a source...

GRASP_QAP
 Referenced in 17 articles
[sw04684]
 assignment problems using GRASP. In the NPcomplete quadratic assignment problem (QAP), n facilities...

PARTY
 Referenced in 10 articles
[sw20518]
 different measures is in most cases NPcomplete. A large number of efficient partitioning heuristics...

MicroEliece
 Referenced in 9 articles
[sw09835]
 could render a large set of cryptosystems completely useless. The McEliece publickey scheme ... decoding unknown linear binary codes is NPcomplete. In this work, we investigate the efficient...

Fgindex
 Referenced in 9 articles
[sw18892]
 subgraph isomorphism testing, which is an NPcomplete problem. In recent years, some effective graph...

LIPSAT
 Referenced in 5 articles
[sw28633]
 witnesses, placing LIPSAT complexity in the NPcomplete class. An exact satisfiability decision algorithm ... probabilistic) logic, that is also an NPcomplete problem. We develop implementations of the algorithms...

CartoDraw
 Referenced in 6 articles
[sw38943]
 case. Because the feasible variants are NPcomplete, heuristics are needed to solve the problem...

PySAT
 Referenced in 6 articles
[sw25459]
 practical problems. Moreover, albeit targeting an NPcomplete problem, SAT solvers are increasingly used...

FES
 Referenced in 5 articles
[sw18532]
 constraint optimization problems proven to be NPcomplete. Furthermore, evaluation of violations is costly...

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 NPcomplete problems, we are able to detect a phase...

URSA
 Referenced in 4 articles
[sw15541]
 approach is wide (e.g., many NPcomplete problems can be simply specified and then solved...

ZENTURIO
 Referenced in 3 articles
[sw02487]
 introduce a generic framework for solving NPcomplete optimisation problems for parallel and grid applications...

libiop
 Referenced in 2 articles
[sw31793]
 these zkSNARKs support R1CS (an NPcomplete relation that generalizes arithmetic circuit satisfiability) over smooth...

LVMSR
 Referenced in 2 articles
[sw02374]
 computing such data distribution paths is NPcomplete. This paper presents a new heuristic algorithm...

ParTriCluster
 Referenced in 2 articles
[sw09645]
 remains a bottleneck due to its NPCompleteness, so its parallelization seems...

PMax
 Referenced in 2 articles
[sw11226]
 company. We show that PMax is NPcomplete. Therefore, we devise a metaheuristic, called...

SCluster++
 Referenced in 2 articles
[sw29662]
 tree containment and CCP are NPcomplete. Although the CCP was introduced a decade...

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