[{"_1":2,"_3":-5,"_4":-5},"loaderData",{"_5":6,"_7":8,"_9":10},"actionData","errors","root",{"_171":172,"_173":174},"routes/public/layout",{"_110":111},"routes/public/primary/notes",{"_11":12,"_13":14},"note",{"_20":46,"_22":46,"_23":100,"_25":101,"_27":102,"_29":30,"_31":103,"_33":104,"_35":105,"_37":106,"_39":107,"_41":108,"_13":109},"backlinks",[15,16,17,18,19],{"_20":44,"_22":44,"_23":85,"_25":86,"_27":87,"_29":30,"_31":88,"_33":89,"_35":90,"_37":91,"_39":92,"_41":93,"_13":94},{"_20":70,"_22":70,"_23":71,"_25":72,"_27":73,"_29":30,"_31":74,"_33":75,"_35":75,"_37":76,"_39":77,"_41":78,"_13":79},{"_20":60,"_22":60,"_23":61,"_25":62,"_27":63,"_29":30,"_31":64,"_33":34,"_35":34,"_37":65,"_39":66,"_41":67,"_13":68},{"_20":48,"_22":48,"_23":49,"_25":50,"_27":51,"_29":30,"_31":52,"_33":34,"_35":34,"_37":53,"_39":54,"_41":55,"_13":56},{"_20":21,"_22":21,"_23":24,"_25":26,"_27":28,"_29":30,"_31":32,"_33":34,"_35":36,"_37":38,"_39":40,"_41":42,"_13":43},"id","computer-science/algorithm/theoretical-knowledges/np-complete-problems","slug","title","NP-complete Problems","path","Computer Science/Algorithm/Theoretical Knowledges/NP-complete Problems","canonicalPath","/notes/computer-science/algorithm/theoretical-knowledges/np-complete-problems","folder","Computer Science","tags",[],"createdAt","2026-07-26T03:12:21.703Z","modifiedAt","2026-07-26T03:12:21.704Z","excerpt","Ini konsep yang cukup rumit, tapi tampaknya ini semacam klasifikasi untuk [[Computational Problem]] yang sulit untuk ditemukan algoritma efisiennya. Buku [[Introduction to Algorithms]] membawakan 3 alasan kenapa masalah ","html","

Ini konsep yang cukup rumit, tapi tampaknya ini semacam klasifikasi untuk Computational Problem yang sulit untuk ditemukan algoritma efisiennya.

Buku Introduction to Algorithms membawakan 3 alasan kenapa masalah NP-complete sangat menarik:

Meskipun belum ditemukan algoritma efisien untuk masalah-masalah NP-complete, tidak ada yang pernah dapat membuktikan bahwa algoritma efisiennya mustahil untuk ditemukan juga
Seperangkat masalah NP-complete punya properti terkenal yang membuat jika algoritma efisien dapat ditemukan untuk salah satu dari mereka, maka berarti algoritma efisien ada untuk mereka semua
Beberapa masalah NP-complete itu mirip, walau tidak identik, dengan masalah yang dapat kita ketahui algoritma efisiennya.

Salah satu yang terkenal adalah Traveling Sales-person Problem.

","outgoing",[46,47,45],[44,45],"computer-science/algorithm/algorithm","computer-science/algorithm/theoretical-knowledges/traveling-sales-person-problem","computer-science/algorithm/theoretical-knowledges/computational-problem","unresolved:introduction-to-algorithms","computer-science/algorithm/theoretical-knowledges/instance-of-a-problem","Instance of a Problem","Computer Science/Algorithm/Theoretical Knowledges/Instance of a Problem","/notes/computer-science/algorithm/theoretical-knowledges/instance-of-a-problem",[],"Instance of a Problem adalah [[Input]] yang dibutuhkan untuk melakukan komputasi solusi terhadap [[Computational Problem]].","

Instance of a Problem adalah Input yang dibutuhkan untuk melakukan komputasi solusi terhadap Computational Problem.

",[59,46],[46,57,58],"computer-science/algorithm/theoretical-knowledges/correct-algorithm","computer-science/algorithm/theoretical-knowledges/incorrect-algorithm","general/terms/input","computer-science/algorithm/theoretical-knowledges/definition-of-algorithm","Definition of Algorithm","Computer Science/Algorithm/Theoretical Knowledges/Definition of Algorithm","/notes/computer-science/algorithm/theoretical-knowledges/definition-of-algorithm",[],"[[Algorithm]] adalah prosedur komputasi yang dibuat dengan baik, dia menerima sebuah nilai atau seperangkat nilai sebagai [[Input]] dan menghasilkan nilai lain atau seperangkat nilai lain sebagai [[Output]] dalam waktu t","

Algorithm adalah prosedur komputasi yang dibuat dengan baik, dia menerima sebuah nilai atau seperangkat nilai sebagai Input dan menghasilkan nilai lain atau seperangkat nilai lain sebagai Output dalam waktu tertentu. Singkatnya, Algoritma adalah urutan langkah komputasi yang merubah input menjadi output.

Algoritma juga bisa dianggap sebagai alat untuk menyelesaikan Computational Problem yang well-specified.

",[44,59,69,46],[44],"general/terms/output","computer-science/algorithm/practical-knowledges/insertion-sort/sorting-problem","Sorting Problem","Computer Science/Algorithm/Practical Knowledges/Insertion Sort/Sorting Problem","/notes/computer-science/algorithm/practical-knowledges/insertion-sort/sorting-problem",[],"2026-07-26T03:12:21.700Z","Salah satu bentuk dari [[Computational Problem]] yang perlu dipecahkan dengan algoritma. Tujuannya adalah untuk menghasilkan [[Permutasi]] dari input yang diberikan. Istilah lain dari input (umumnya deret angka) tersebut","

Salah satu bentuk dari Computational Problem yang perlu dipecahkan dengan algoritma. Tujuannya adalah untuk menghasilkan Permutasi dari input yang diberikan.

Istilah lain dari input (umumnya deret angka) tersebut adalah Keys. Saat kita ingin mengurutkan suatu deret, biasanya karena Keys tersebut terkait dengan data lain yang disebut Satellite Data. Keys dan Satellite Data bersama-sama membentuk Record.

Ketika mengulas sebuah Sorting Problem, kita akan fokus ke Keys, tapi harus tetap diperhatikan bahwa umumnya akan ada Satellite Data terkait Keys tersebut.

",[46,81,82,83,84],[80],"computer-science/algorithm/practical-knowledges/insertion-sort/insertion-sort","general/terms/permutasi","computer-science/algorithm/practical-knowledges/insertion-sort/keys","computer-science/algorithm/practical-knowledges/insertion-sort/satellite-data","computer-science/algorithm/practical-knowledges/insertion-sort/record","Algorithm","Computer Science/Algorithm/Algorithm","/notes/computer-science/algorithm/algorithm",[],"2026-07-26T03:12:21.696Z","2026-07-26T03:12:21.697Z","Theoretical Knowledges [[Definition of Algorithm]] [[Computational Problem]] [[Algorithmic Problem]] [[Conditions of an Algorithm]] [[Data Structure]] [[NP-complete Problems]] [[Online Algorithm]] [[Pseudocode]] Practica","

Theoretical Knowledges

Definition of Algorithm\nComputational Problem\nAlgorithmic Problem\nConditions of an Algorithm\nData Structure\nNP-complete Problems\nOnline Algorithm\nPseudocode

Practical Knowledges

Insertion Sort

",[60,46,95,96,97,21,98,99,80],[60],"computer-science/algorithm/theoretical-knowledges/algorithmic-problem","computer-science/algorithm/theoretical-knowledges/conditions-of-an-algorithm","computer-science/algorithm/theoretical-knowledges/data-structure","computer-science/algorithm/theoretical-knowledges/online-algorithm","computer-science/algorithm/practical-knowledges/insertion-sort/pseudocode","Computational Problem","Computer Science/Algorithm/Theoretical Knowledges/Computational Problem","/notes/computer-science/algorithm/theoretical-knowledges/computational-problem",[],"2026-07-26T03:12:21.701Z","2026-07-26T03:12:21.702Z","Ini merupakan masalah yang memerlukan algoritma untuk dapat diselesaikan. Computational Problem yang well-defined akan selalu menyediakan [[Instance of a Problem]] untuk diolah.","

Ini merupakan masalah yang memerlukan algoritma untuk dapat diselesaikan. Computational Problem yang well-defined akan selalu menyediakan Instance of a Problem untuk diolah.

",[48],[44,70,60,48,21],"profile",{"_20":112,"_113":110,"_114":115,"_116":117,"_118":119,"_120":121,"_33":122,"_123":124},"6954a19b11e7fe6da253c845","type","identity",{"_161":162,"_163":164,"_165":166,"_167":168},"contact",{"_153":154,"_155":156},"seo",{"_23":137,"_138":139,"_140":141,"_142":143,"_144":145,"_146":147},"bio",{"_125":126,"_127":128,"_129":130,"_131":132,"_133":134,"_135":136},"2025-12-31T04:07:55.862Z","updatedAt","2026-07-28T08:55:52.260Z","p1","Maulana Hafidz Ismail is an engineer who believes technology isn't just about efficiency. It's about resistance.","p2","While the world optimizes for profit, he builds to question the system itself: in education, work, and how we define value.","p3","His background blends engineering precision with entrepreneurial instinct. He has worked across software development, database systems, and AI, always driven by one goal: to make tools that actually serve people, not the hierarchy itself.","closing","This site is his lab. He writes journals to document a process, articles to share thought, and papers to formalize the things he learns.","tagline","Some ideas fail, some evolve, all of them teach.","callToAction","If you're building, rebelling, or just thinking about how to make things better, you're already part of the conversation.","Maulana Hafidz","description","Technical articles, engineering notes, system design explorations, and project documentation by Maulana Hafidz Ismail, an Engineer documenting real software systems.","shortDescription","Maulana Hafidz Ismail is an Engineer and Entrepreneur in training. Redefining fairness in education, work, and governance.","url","https://maulanahafidz.com","image","https://maulanahafidz.com/og-image.jpg","keywords",[148,149,150,151,152],"Meta Engineer","Entrepreneur","Software Engineer","AI Developer","System Designer","email","contact@maulanahafidz.com","socials",{"_157":158,"_159":160},"github","https://github.com/imhefizh/","linkedin","https://www.linkedin.com/in/maulana-hafidz-ismail/","fullName","Maulana Hafidz Ismail","shortName","ImHefizh","titles",[169,170],"subtitle","Building systems that question the system.","Software Engineering","Entrepreneurship","nonce","552424cf3c524d019ea51eba5ae5358c","language","EN"]

Linked mentions