reductions(編輯修改稿)
2025-08-13 16:55 本頁面
【文章內(nèi)容簡介】 集 M使得 V1和 V2中的每個點與 E相交一條邊。 – 如學(xué)生申請大學(xué) Matching Algorithm ? Reduction to Network Flow problem: the latter has a polynomial time solution. NP：多項式時間可以驗證“正確解”的問題 ? 匹配：給定一圖， G＝ (V,E), 如何找到邊集合 E的子集 C形成一個圈圖， ? Hamiltonian 圈： C經(jīng)過 G中每一點恰好一次。 – 見右圖 ? 歐拉圈： C經(jīng)過 G中每一邊恰好一次。 – 如左圖國王堡七橋問題 NPHard？ ? 可以在多項式時間 將 3SAT問題 reduce到Hamiltonain圈 3SAT is NPhard So is Hamiltonain圈 ? 歐拉圈多項式時間可解。 應(yīng)用領(lǐng)域 這是 AI嗎 ？ ? It is my conviction that intentional phenomenology has for the first time made spirit as spirit the field of systematic scientific experience, thus effecting a total transformation of the task of knowledge.” – Edmund Husserl, Crisis of European Humanity, Pt. II, 1935 圖靈測試 反向圖靈測試 Machine Translation Eidetic reduction ? By which the philosopher moves from – the consciousness of individual and concrete objects ? to – the transempirical realm of pure essences ? and thus achieves an intuition of the eidos (Greek: “ shape” ) of a thing— – ., of what it is in its invariable and essential structure, apart from all that is contingent or accidental to it. ? From Encyclopeadia Britannica
規(guī)章制度相關(guān)推薦
鄂ICP備17016276號-1