Adult Content Warning

This work could have adult content. If you continue, you have agreed that you are willing to see such content.

If you accept cookies from our site and you choose "Yes, Continue", you will not be asked again during this session (that is, until you close your browser). If you log in you can store your preference and never be asked again.

  1. 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.

    Language:
    English
    Words:
    33,927
    Chapters:
    2/3
    Comments:
    20
    Kudos:
    51
    Bookmarks:
    11
    Hits:
    725