{
	"id": 8217885151,
	"name": "P = NP",
	"description": "P = NP is an important open problem in computer science. P means the set of all problems that can be *solved* in polynomial time, while NP is the set of all problems that can be *verified* in polynomial time. (\"Polynomial time\" can be thought of as meaning \"efficiently solvable\").\n\nIf P = NP, that means that every problem whose solutions can be efficiently verified can also be efficiently solved. However, nobody has yet been able to prove whether it is true or false.\n\nMost computer scientists believe that P ≠ NP (P does not equal NP). Reflecting this, the equals sign gained a strikethrough at some point, which remained until the end of the event.",
	"links": {},
	"path": {
		"35-48": [
			[
				421,
				224
			],
			[
				421,
				218
			],
			[
				437,
				218
			],
			[
				437,
				224
			]
		]
	},
	"center": {
		"35-48": [
			429,
			221
		]
	}
}