In this work, we critique two papers, “A Polynomial-Time Solution to the Clique Problem” by Tamta, Pande, and Dhami [3], and “A Polynomial-Time Algorithm For Solving Clique Problems” by LaPlante [1]. We summarize and analyze both papers, noting that the algorithms presented in both papers are flawed. We conclude that neither author has successfully established that P = NP.

the relationship between trade liberalisation and the environment has been the subject of a growing body of literature in recent years. as can be seen from the differing assessment of instrument types for environmental protection, one of the important factors for the relationship between environmental protection and economic competitiveness are regulatory stringency and efficiency. this concern...

the aim of this study was to assess the predictive effect of the ebmt risk score on the outcomes of allogeneic stem cell transplantation in a relatively homogenous group of acute myelogenous leukemia (aml) patients regarding the occurrence of acute and chronic graft versus host disease (gvhd). this historical cohort study included adult patients (≥ 15 years old) with aml (n=363) who received al...

In this work we consider the problem of finding a minimum Ck-transversal (a subset of vertices hitting all the induced chordless cycles with k vertices) in a graph with bounded maximum degree. In particular, we seek for dichotomy results as follows: for a fixed value of k, finding a minimum Ck-transversal is polynomial-time solvable if k ≤ p, and NP -hard otherwise.

The unichain condition requires that every policy in an MDP result in a single ergodic class, and guarantees that the optimal average cost is independent of the initial state. We show that checking whether the unichain condition fails to hold is an NP-complete problem. We conclude with a brief discussion of the merits of the more general weak accessibility condition. © 2006 Elsevier B.V. All ri...

The 3 km Dark Target (DT) aerosol optical depth (AOD) products, 10 km DT and Deep Blue (DB) AOD products from the Collection 6 (C6) product data of Moderate Resolution Imaging Spectroradiometer (MODIS) are compared with Sun-sky Radiometer Network (SONET) measurements at Song Mountain in central China, where ground-based remote sensing measurements of aerosol properties are still very limited. T...

The paper is made rediculously irrelevant in light of realization that NP is anything a DTM can solve in time 2^p(|n|). One theorem found on one page taking up about 1 inch in exactly one text. The author therefore no longer supports the nonsense it purports.

This paper proposes a DNA algorithm for solving an NP-complete problem (The Shortest Common Super-string Problem) by manipulation of biomolecules, and presents partial results of the experiment that implements our algorithm. We also discuss practical constraints that have to be taken into account when implementing the algorithm, propose a coding system as a solution to these practical restricti...

The measure hypothesis is a quantitative strengthening of the P != NP conjecture which asserts that NP is a nonnegligible subset of EXP. Cai, Sivakumar, and Strauss (1997) showed that the analogue of this hypothesis in P is false. In particular, they showed that NTIME[n^{1/11}] has measure 0 in P. We improve on their result to show that the class of all languages decidable in nondeterministic s...

Given a graph G = (V, E) and an integer D ≥ 1, we consider the problem of augmenting G by a minimum set of new edges so that the diameter becomes at most D. It is known that no constant factor approximation algorithms to this problem with an arbitrary graph G can be obtained unless P = NP , while the problem with only a few graph classes such as forests is approximable within a constant factor....