Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Potrepka, Nathaniel S."'
In this work, we critique two papers, "A Polynomial-Time Solution to the Clique Problem" by Tamta, Pande, and Dhami, and "A Polynomial-Time Algorithm For Solving Clique Problems" by LaPlante. We summarize and analyze both papers, noting that the algo
Externí odkaz:
http://arxiv.org/abs/1504.06890
