Adult Content Warning
This work could have adult content. If you continue, you have agreed that you are willing to see such content.
-
NP-complete by limenska
Fandoms: 呪術廻戦 | Jujutsu Kaisen (Manga), 呪術廻戦 | Jujutsu Kaisen (Anime)
31 Dec 2025
Tags
Summary
NP-complete problems are computationally hard problems where verifying a solution is easy and can be done in polynomial time, but finding one is difficult. They represent a class of crucial optimization and decision problems with no known efficient general solution.
Does a graph contain a path or cycle that visits every vertex exactly once? Given a set of integers, does any non-empty subset sum to a specific target value? Does your asshole brother want to fuck you just as badly as you want to fuck him?
Yuji manages to verify his highly suboptimal solution to the last problem.
