🇬🇧 en es 🇪🇸

NP-complete adjective

  • (computing theory, of a, decision problem) That is both NP (solvable in polynomial time by a non-deterministic Turing machine) and NP-hard (such that any (other) NP problem can be reduced to it in polynomial time).
 NP-completo

🇬🇧 en es 🇪🇸

to preposition

  /tu/ , /tuː/ , /tə/ , /tʉː/ , /tʊ/ , [tʰu̟] , [tʰu̟ː] , [tʰʉː] , [ɾə] , [ɾʊ]
  • Used to indicate the target or recipient of an action.
  • (arithmetic) Used to indicate that the preceding term is to be raised to the power of the following value; indicates exponentiation.
 a
  • Indicating destination: In the direction of, so as to arrive at.
 a, hacia
  • (time) Preceding the next hour.
 menos, para

to particle

  /tu/ , /tuː/ , /tə/ , /tʉː/ , /tʊ/ , [tʰu̟] , [tʰu̟ː] , [tʰʉː] , [ɾə] , [ɾʊ]
  • (expressing purpose) In order to.
 para
  • A particle used for marking the following verb as an infinitive.
 -ar, -er, -ir