3-satisfiability problem

special case of the Boolean satisfiablility problem in conjunctive normal form where each clause has ≤3 literals

Wikidata entity: Q339688

P10374	computational complexity	...	Q215206 (NP-complete)	NP-complete
P31	instance of	...	Q215206 (NP-complete)	NP-complete
P31	instance of	...	Q3435924 (computational problem)	computational problem
P361	part of	...	Q1734364 (Karp's 21 NP-complete problems)	Karp's 21 NP-complete problems
P1482	Stack Exchange tag	Url	Newest '3-sat' Questions - Computer Science Stack Exchange	???
P1482	Stack Exchange tag	Url	Newest '3sat-problem' Questions - Quantum Computing Stack Exchange	???

External Ids

P6564	Brilliant Wiki ID	3sat
P2671	Google Knowledge Graph ID	/g/1229kf2b

Why not click here or view trends?

log id: 5983927