Inglês » Alemão

Traduções para „NP-complete“ no dicionário Inglês » Alemão (Salte para Alemão » Inglês)

NP-complete ADJ

Entrada criada por um utilizador

- Editar entrada
- Sugerir eliminação

NP-complete COMPUT

NP-vollständig

Exemplos unilingues (não verificados pela redação)

inglês

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

It is also NP-complete to determine whether the vertices of a graph can be partitioned into two induced paths, or two induced cycles. en.wikipedia.org

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

This method shows that many subcases of the subgraph isomorphism problem (an NP-complete problem) can in fact be solved in polynomial time. 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

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

The problem of finding the best ordering is an NP-complete problem and is thus intractable, so heuristic methods are used instead. en.wikipedia.org

However, the problem is NP-complete if "k" is part of the input. 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

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

Desejar acrescentar uma palavra, uma frase ou uma tradução?

Envie-nos uma nova entrada.

Consulte o dicionário

inglês

Página em Deutsch | Български | Ελληνικά | English | Español | Français | Italiano | Polski | Português | Русский | Slovenščina | Srpski | Türkçe | 中文