|
WrenP-Complete posted:my username dictates i must post in this thread. P=NURTIS
|
#
¿
May 20, 2017 22:13
|
|
|
|
| # ¿ May 14, 2024 00:25 |
|
|
Cybernetic Vermin posted:more like no one should expect np to be efficiently solvable, but it could be that there exists some monstrous, but still polynomial, bound for those problems (e.g. it turns out that satisfiability is solvable in time n^100), which would rather mean the end for the polynomial hierarchy as a way of separating these things than it would mean that np-complete problems can be efficiently solved eat my balls
|
|
#
¿
Jun 5, 2017 13:04
|
|
|
ConanTheLibrarian posted:the most common form (C3) is a lovely hack which is why an improved form (C4) has independently evolved dozens of times plants don't think, idiot hell fucker
|
|
#
¿
Jun 7, 2017 20:55
|
|
|
if p = np when n is 1 or p is 0 then clearly p = np because those are the only two numbers that exist, duh
|
|
#
¿
Jun 9, 2017 21:26
|
|
|
Endless Mike posted:what if p = 1 and n = 0, op stack underflow
|
|
#
¿
Jun 10, 2017 22:12
|
|
|
Lutha Mahtin posted:did u kno, there are other complexity classes besides p and np. its true nobody cares though
|
|
#
¿
Jun 10, 2017 23:37
|
|
|
|
| # ¿ May 14, 2024 00:25 |
|
|
Lutha Mahtin posted:aside from the people who actually understand complexity classes lol pram posted:yeah but this thread isnt for people who understand stuff. its for shower thoughts about a wikipedia article i read and beeping noises that soothe the autism traveling salesman goes bep bep
|
|
#
¿
Jun 11, 2017 14:11
|
|