Everything2

NP Complete Problem

Y'know, if you log in, you can write something here, or contact authors directly on the site. Create a New User if you don't already have an account.

NP-complete	The traveling salesman problem	NP	How to tell whether a figure can be drawn in one stroke
NP-	P = NP	Wearing nice underpants does not necessarily mean it's a date	Halting problem
conversation with a script kiddie	Hamilton Circuit	Gram-Schmidt Theorem	Banana Yoshimoto
Plan 9	heuristic	clique	Turing Machine
The Eternity Puzzle	Norwegian polite phrases	Time complexity	Deterministic Turing Machine
Universal Turing Machine	Everything University	NPC	ASIC

Login
Password