Prevodi za „NP-complete“ u rečniku engleski » nemački

NP-complete ADJ

Korisnička odrednica

NP-complete COMPUT

NP-vollständig

Jednojezični primeri (nisu ih verifikovali PONS urednici)

engleski

However, finding such an optimal alignment for a large number of sequences has been determined to be an NP-complete problem.

en.wikipedia.org

For the case of multiple commodities, the problem is NP-complete for integer flows.

en.wikipedia.org

As a subclass of the perfect graphs, many problems that are NP-complete for arbitrary graphs may be solved efficiently for permutation graphs.

en.wikipedia.org

Multiple sequence alignments are computationally difficult to produce and most formulations of the problem lead to NP-complete combinatorial optimization problems.

en.wikipedia.org

This is an example of a problem that is thought to be hard, but is not thought to be NP-complete.

en.wikipedia.org

Also, he considers the appendix as unique and as a starting point in attempts to show new problems to be NP-complete.

en.wikipedia.org

Solving a constraint satisfaction problem on a finite domain is an NP-complete problem in general.

en.wikipedia.org

Finding maximal induced subgraphs of a certain kind is also often NP-complete.

en.wikipedia.org

However, the same problem is NP-complete when the input may be a mixed graph.

en.wikipedia.org

It is NP-complete to test whether a graph contains a skew partition in which one of the parts of the co-disconnected side is independent.

en.wikipedia.org