Instalar Steam
iniciar sesión
|
idioma
简体中文 (Chino simplificado)
繁體中文 (Chino tradicional)
日本語 (Japonés)
한국어 (Coreano)
ไทย (Tailandés)
български (Búlgaro)
Čeština (Checo)
Dansk (Danés)
Deutsch (Alemán)
English (Inglés)
Español - España
Ελληνικά (Griego)
Français (Francés)
Italiano
Bahasa Indonesia (indonesio)
Magyar (Húngaro)
Nederlands (Holandés)
Norsk (Noruego)
Polski (Polaco)
Português (Portugués de Portugal)
Português - Brasil (Portugués - Brasil)
Română (Rumano)
Русский (Ruso)
Suomi (Finés)
Svenska (Sueco)
Türkçe (Turco)
Tiếng Việt (Vietnamita)
Українська (Ucraniano)
Informar de un error de traducción
🐠🎈🚕🥗🎫😺🐳📗👹👽👾🥞🌋🕺🚙
HOW TO PROVE IT, PART 4
proof by personal communication:
'Eight-dimensional colored cycle stripping is NP-complete
[Karp, personal communication].'
proof by reduction to the wrong problem:
'To see that infinite-dimensional colored cycle stripping is
decidable, we reduce it to the halting problem.'
proof by reference to inaccessible literature:
The author cites a simple corollary of a theorem to be found
in a privately circulated memoir of the Slovenian
Philological Society, 1883.
proof by importance:
A large body of useful consequences all follow from the
proposition in question.
🏀🐝📘🌽🎍👹🚘💄🥒😺⛳📕💛🍧🏓
💎🚕💚🐟💗🌳🥞🌏🐊👑🎈🔋🍆👃💃