Steam installeren
inloggen
|
taal
简体中文 (Chinees, vereenvoudigd)
繁體中文 (Chinees, traditioneel)
日本語 (Japans)
한국어 (Koreaans)
ไทย (Thai)
Български (Bulgaars)
Čeština (Tsjechisch)
Dansk (Deens)
Deutsch (Duits)
English (Engels)
Español-España (Spaans - Spanje)
Español - Latinoamérica (Spaans - Latijns-Amerika)
Ελληνικά (Grieks)
Français (Frans)
Italiano (Italiaans)
Bahasa Indonesia (Indonesisch)
Magyar (Hongaars)
Norsk (Noors)
Polski (Pools)
Português (Portugees - Portugal)
Português - Brasil (Braziliaans-Portugees)
Română (Roemeens)
Русский (Russisch)
Suomi (Fins)
Svenska (Zweeds)
Türkçe (Turks)
Tiếng Việt (Vietnamees)
Українська (Oekraïens)
Een vertaalprobleem melden
🐠🎈🚕🥗🎫😺🐳📗👹👽👾🥞🌋🕺🚙
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.
🏀🐝📘🌽🎍👹🚘💄🥒😺⛳📕💛🍧🏓
💎🚕💚🐟💗🌳🥞🌏🐊👑🎈🔋🍆👃💃