Co-NP-complete
Co-NP-completo
NP-complete oor Spaans
NP-complete
en
(computing theory) Describing the hardest problems that are in the class NP, and whose solutions can be verified in polynomial time.
Vertalings in die woordeboek Engels - Spaans
NP-completo
Think about it, predicting protein structures as np-complete.
Piénsalo, la predicción de estructuras proteínicas como NP-Completo.
Geskatte vertalings
Vertoon algoritmies gegenereerde vertalings
Soortgelyke frases
voorbeelde
Advanced filtering
Voorbeelde moet herlaai word.
However, there are other, broader notions of NP-completeness that also allow us to claim Theorem 10.5.
¡ Bienvenidos al entrenamiento contra dragones!Literature Literature
The following theorem shows why such a reduction proves the target problem to be NP-complete.
No puedo dormir hasta volver a verteLiterature Literature
The problem is NP-complete, and can be formulated as an integer-linear-programming problem.
por el que se establece un derecho antidumping provisional sobre las importaciones de ácido tricloroisocianúrico originarias de la República Popular China y de los Estados Unidos deAméricaLiterature Literature
Kirousis and Papadimitriou (1988) showed that line-labeling for trihedral scenes is NP-complete.
Pero deje de jugar al conspiradorLiterature Literature
For example: Finding the largest complete subgraph is called the clique problem (NP-complete).
Estaba aquí desde el principioWikiMatrix WikiMatrix
Since deciding entailment is equivalent to decid ing unsatisfiability, it is co-NP-complete.
Eso es lo que te pasaLiterature Literature
The Cook–Levin theorem states that the Boolean satisfiability problem is NP-complete.
Sin perjuicio de lo dispuesto en el apartado #, el traslado de una persona que deba ser readmitida en virtud de una de las obligaciones enunciadas en los artículos # y # requerirá la presentación de una solicitud de readmisión a la autoridad competente del Estado requeridoWikiMatrix WikiMatrix
The directed and undirected Hamiltonian cycle problems were two of Karp's 21 NP-complete problems.
¡ Les enseñaré a violar mis reglas!WikiMatrix WikiMatrix
Show that 4TA-SAT is NP-complete.
Partiendo del coeficiente de solvencia mínimo del # %, aplicable desde el # de junio de #, el valor correspondiente sería de # millones de marcos alemanes (# millones de eurosLiterature Literature
It is easy to prove that the halting problem is NP-hard but not NP-complete.
El PresidenteWikiMatrix WikiMatrix
Such a problem is said to be NP-complete.
Hmm, parece que atraes a muchos hombresLiterature Literature
It's np-complete.
Por alguna razón, no dejo de creer que Shingen esta muertoOpenSubtitles2018.v3 OpenSubtitles2018.v3
That's what np-complete means.
¿ Qué no ves que estoy trabajando?OpenSubtitles2018.v3 OpenSubtitles2018.v3
There are decision problems that are NP-hard but not NP-complete, for example the halting problem.
Un tiro más de los dados Y se acabó el asuntoWikiMatrix WikiMatrix
If any particular NP-complete problem can be proved to be P, then P = NP.
Antes de que me dejarasLiterature Literature
Theorem 10.5: If some NP-complete problem P is in P , then P = NP .
harina de maderaLiterature Literature
Here's what you would normally do for an NP- complete problem as we have talked about so far:
¿ Te refieres a viajar a esas aguas?QED QED
Whether under these types of reductions the definition of NP-complete changes is still an open problem.
Revisaré el bañoWikiMatrix WikiMatrix
Each co-NP-complete problem is the complement of an NP-complete problem.
Me da terror despertar y estar untando pan con ajo... esperando que mi vida comienceWikiMatrix WikiMatrix
Cook introduced the notion of an NP-complete problem.
TEXTO DE LA COMISIÓNLiterature Literature
However, this does not imply that the structural alignment problem is NP-complete.
No hay peligro para la cumbreWikiMatrix WikiMatrix
If only ∀ quantifiers are allowed instead, the so-called tautology problem is obtained, which is co-NP-complete.
DefinicionesWikiMatrix WikiMatrix
These problems are not known to be in P or NP-complete.
Porque los dirigentes fallan en todo el mundo.WikiMatrix WikiMatrix
It is not the purpose of this book to cover applications of the problems we prove NP-complete.
Eres un hijo de puta egoísta como todos los demás!Literature Literature
We say L is NP-complete if the following statements are true about L: 1.
Eres fuerteLiterature Literature
363 sinne gevind in 9 ms. Hulle kom uit baie bronne en word nie nagegaan nie.