Kayibi, K. K. (2018). There is a Hyper-Greedoid lurking behind every Graphical Accessible Computational Search Problem solvable in Polynomial Time: $P \not= NP$.
Chicago Style (17th ed.) CitationKayibi, Koko-Kalambay Kalafan. There Is a Hyper-Greedoid Lurking Behind Every Graphical Accessible Computational Search Problem Solvable in Polynomial Time: $P \not= NP$. 2018.
MLA (9th ed.) CitationKayibi, Koko-Kalambay Kalafan. There Is a Hyper-Greedoid Lurking Behind Every Graphical Accessible Computational Search Problem Solvable in Polynomial Time: $P \not= NP$. 2018.
Warning: These citations may not always be 100% accurate.