Asenna Steam
kirjaudu sisään
|
kieli
简体中文 (yksinkertaistettu kiina)
繁體中文 (perinteinen kiina)
日本語 (japani)
한국어 (korea)
ไทย (thai)
български (bulgaria)
Čeština (tšekki)
Dansk (tanska)
Deutsch (saksa)
English (englanti)
Español – España (espanja – Espanja)
Español – Latinoamérica (espanja – Lat. Am.)
Ελληνικά (kreikka)
Français (ranska)
Italiano (italia)
Bahasa Indonesia (indonesia)
Magyar (unkari)
Nederlands (hollanti)
Norsk (norja)
Polski (puola)
Português (portugali – Portugali)
Português – Brasil (portugali – Brasilia)
Română (romania)
Русский (venäjä)
Svenska (ruotsi)
Türkçe (turkki)
Tiếng Việt (vietnam)
Українська (ukraina)
Ilmoita käännösongelmasta
💚🎁🎍🎽💄💎🍖💛🌳👑💚💃💙🌏🚙
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.
👃🌂💗👔📗📒🥗😺🐟🐠🐛🍇🐝🏀🔋
🎈👾👃🌋🕺🐊👳🏓🥒🚘🎁🥞👔🚗🎄
░░░░░▐▀█▀▌░░░░▀█▄░░░
░░░░░▐█▄█▌░░░░░░▀█▄░░
░░░░░░▀▄▀░░░▄▄▄▄▄▀▀░░
░░░░▄▄▄██▀▀▀▀░░░░░░░
░░░█▀▄▄▄█░▀▀░░
░░░▌░▄▄▄▐▌▀▀▀░░
▄░▐░░░▄▄░█░▀▀ ░░
▀█▌░░░▄░▀█▀░▀ ░░ ░
░░░░░░░▄▄▐▌▄▄░░░ ░ ░
░░░░░░░▀██████▀██████████▄░ ░ ░
░░░░░░▐▌▀▄▀▄▀▐▄░░ ░ ░░
░░░░░░▐▀░░░░░░▐▌░░ ░
░░░░░░█░░░░░░░░█░░░