【作者(必填)】Zohreh O. Akbari

【文题(必填)】A Deterministic Polynomial-time Algorithm for the Clique Problem and the Equality of P and NP Complexity Classes

【年份(必填)】November 2008

【全文链接或数据库名称(选填)】http://connection.ebscohost.com/c/articles/36317088/deterministic-polynomial-time-algorithm-clique-problem-equality-p-np-complexity-classes