M. Janczak

most citedA Refutation of the Clique-Based P=NP Proofs of LaPlante and Tamta-Pande-Dhami

1 citations · 2 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2017★ 1 cited

A multi-parameter variant of the Erdős distance problem

Alex Iosevich, Maria Janczak, Jonathan Passant

We study the following variant of the Erdős distance problem. Given $E$ and $F$ a point sets in $R^{d}$ and $p = (p_{1}, \dots, p_{q})$ with $p_{1} + \dots + p_{q} = d$ is an incre…

cs.CC2015★ 1 cited

A Refutation of the Clique-Based P=NP Proofs of LaPlante and Tamta-Pande-Dhami

Hector A. Cardenas, Chester Holtz, Maria Janczak +2

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" b…