activity
20152025
most citedLearning Sample Reweighting for Accuracy and Adversarial Robustness

3 citations · 5 across the 6 of their papers we have counts for

collaborators
Showing cs.CCShow all

1 paper · 1 filter

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…