{{
`${userDetail.user.displayName}${userDetail.user.cachedBungieGlobalDisplayNameCode ? `#${standardizeBungieGlobalCode(userDetail.user.cachedBungieGlobalDisplayNameCode)}` : ""}`}}
{{getUserClans()}}
4/1/2016 7:36:33 PM
2
-
That's what I thought bitch
-
Not even close babyyyyyyyyyyyy
-
Do you have anything that you didn't see on YouTube to say?
-
Modificato da Garen Sol: 4/2/2016 12:46:03 AMNot really babyyyyyyyyyyyyyyyyyy I'm a robot that encapsulates all youtuber speech patterns to order to grow my own popularity. Support me on patreon at youdontunderstandsatire.com
-
Mad cause you are getting called out
-
Ayyyyyy lmao kkkkkkk
-
P problems take polynomial amounts of time to solve(that's what stands for) Multiplication division etc. Np problems take exponentially more time to solve as they get more complex(like sudoku) the problem is we don't know if they are fundamentally different types of problems. We don't know if NP type problems have fundamentally different ways of solving them then p problems. I and most of the community that knows about this think they are fundamentally different.
-
Also it's primarily used for computers and whether they can solve a problem as quickly as they can check it. There are also two tiers (if I remember correctly) so you were close buuuutttt not good enough ://///////
