You are currently browsing the tag archive for the ‘NP-complete’ tag.
Going over the last few installments of Pocket Morning Weekly Q&A, posted in translation at Hello!Online, one might notice a developing interest in mathematics by none other than Michishige Sayumi:
Question: Is there something about which you’ve thought, “Certainly this year, I want to challenge myself with this!”?
Michishige: Math Problems ☆
Question: Fill in the blank to the right with one word. “I’m surprisingly ___”
Michishige: I’m surprisingly intellectual.
Please try to understand that somehow. m(・-・)m
The evidence is indisputable. Sayumi is a math geek. XD
While her fellow MoMusu are busy with more mundane interests, our Sayumi is off challenging herself with math problems (here, Sayu, try Project Euler) and has apparently discovered the wonders of linear algebra (I’m assuming at least some of those simultaneous equations are linear). No doubt Sayumi has mastered the techniques of Gauss-Jordan elimination, Cramer’s rule, and LU decomposition and is well on her way to achieving world domination.
In addition to this, Sayumi has listed Tetris as a hobby and as a “special skill”. This is by far the geekiest interest I’ve seen in any H!P member. Because Tetris is not your average video game. It is a mind-stretching mathematical puzzle, and several of its subproblems are NP-complete. NP-complete, I tell you! This places it in the class of difficult problems that includes Boolean k-satisfiability, determining the existence of a Hamiltonian path, and Minesweeper.
Sayumi is hardcore.
For this, she gets an Excellence in Unabashed Geekitude Award.
And I still need to give Koharu one, don’t I?