K. K. Kayibi

collaborators

2 papers

math.CO2018

Mixing Time of Markov chain of the Knapsack Problem

Koko K. Kayibi, S. Pirzada, Carrie Rutherford

To find the number of assignments of zeros and ones satisfying a specific Knapsack Problem is $# P$ hard, so only approximations are envisageable. A Markov chain allowing uniform s…

cs.CC2018

There is a Hyper-Greedoid lurking behind every Graphical Accessible Computational Search Problem solvable in Polynomial Time: $P \neq = N P$

Koko-Kalambay Kalafan Kayibi

Consider $G [X]$ , where $G$ is a connected, isthmus-less and labelled graph, and $X$ is the edge-set or the vertex-set of the graph $G$ . A Graphical Search Problem (GSP), denoted $Π…

Mixing Time of Markov chain of the Knapsack Problem

There is a Hyper-Greedoid lurking behind every Graphical Accessible Computational Search Problem solvable in Polynomial Time: P=NP

There is a Hyper-Greedoid lurking behind every Graphical Accessible Computational Search Problem solvable in Polynomial Time: $P \neq = N P$