view wisdom/np-complete @ 12284:82cb3de99d33 draft

<b_jonas> `` f=/hackenv/bin/botloop; >$f echo $\'#!/bin/sh\\necho no\'; chmod -c a+x "$f"
author HackEso <hackeso@esolangs.org>
date Wed, 01 Jan 2020 09:35:29 +0000
parents aa3200667614
children
line wrap: on
line source

NP-complete is the subset of NP to which all problems in P can be reduced, thus completely solving them.