「NP complete」の共起表現(1語右で並び替え)

Weblio 辞書 > 英和辞典・和英辞典 > NP completeの意味・解説 > NP completeに関連した共起表現

意味

例文

共起表現

「NP complete」の共起表現一覧(1語右で並び替え)

該当件数 : 37件

Dominating set is	NP-complete and therefore the k-center problem is also
The Hamiltonian path problem is	NP-complete, and hence the minimum path cover problem i
ing if it is greater than a given number is	NP-complete, as shown by Yannakakis and Gavril in 1978
ven size in a graph (the clique problem) is	NP-complete, but despite this hardness result many algo
theory, induced subgraph isomorphism is an	NP-complete decision problem that involves finding a gi
that the decision variant of the problem is	NP-complete even when G is a bipartite graph.
Some of these problems are	NP-complete for general graphs.
The problem is	NP-complete for integer flows, even for only two commod
, many graph optimization problems that are	NP-complete for arbitrary planar graphs, such as findin
complexity of the Graph Sandwich Problem is	NP-complete for the following graph families: chordal g
f Richard Karp's original 21 problems shown	NP-complete in his 1972 paper "Reducibility Among Combi
This decision problem is known to be	NP-complete; it is one of Karp's 21 NP-complete problem
is often used in the literature as a known	NP-complete problem in a reduction to show that other p
ses of the subgraph isomorphism problem (an	NP-complete problem) can in fact be solved in polynomia
minimum clique cover is a graph-theoretical	NP-complete problem.
r of sequences has been determined to be an	NP-complete problem.
sly as 1-in-3 SAT and exactly-1 3SAT) is an	NP-complete problem.
Km,n with maximal number of edges mn is an	NP-complete problem.
aper demonstrating that all currently known	NP-complete problems remain NP-complete even under AC0
Some	NP-complete problems for hypergraph degree sequences, C
xhibit the worst-case behaviour inherent in	NP-complete problems (e.g.
Some	NP-complete problems (such as the travelling salesman p
The max-cut problem is one of Karp's 21	NP-complete problems.
k independently discovered the existence of	NP-complete problems.
nknowns are binary, is one of the Karp's 21	NP-complete problems.
adict the fact that the knapsack problem is	NP-complete, since W, unlike n, is not polynomial in th
As graph coloring in general is	NP-complete, so is register allocation.
iltonian cycles in maximal planar graphs is	NP-complete, so is the problem of testing whether the b
nce the decision problem described above is	NP-complete, this optimization problem is NP-hard, and
orm a subset of the perfect graphs, but are	NP-complete to recognize.
It is	NP-complete to determine whether A(G) ≤ 3 (Kostochka 19
It is also	NP-complete to determine whether the vertices of a grap
, then it may be non-Hamiltonian, and it is	NP-complete to test Hamiltonicity for these graphs.
out to be false, then it can be shown to be	NP-complete to test whether a bipartite cubic polyhedro
graphs, the maximum independent set remains	NP-complete to find exactly but may be approximated to

共起表現

「NP complete」の共起表現(1語右で並び替え) - Weblio英語共起表現検索

「NP complete」の共起表現一覧(1語右で並び替え)