Koko K. Kayibi

1. There is a Hyper-Greedoid lurking behind every Graphical Accessible Computational Search Problem solvable in Polynomial Time: P \not= NP
   2018/01/30 by Koko-Kalambay Kalafan Kayibi, Koko K. Kayibi, Kayibi, Koko-Kalambay Kalafan · 1 voice
   Computer Science · #Data Management and Algorithms #Constraint Satisfaction and Optimization #Advanced Database Systems and Queries