3 papers
cs.DS2018
A Non-iterative Parallelizable Eigenbasis Algorithm for Johnson Graphs
Jackson Abascal, Amadou Bah, Mario Banuelos +2
We present a new method for generating an orthogonal basis of eigenvectors for the Johnson graph . Unlike standard methods for computing a full eige…
cs.CC2017
Critique of Barbosa's "P != NP Proof"
Jackson Abascal, Shir Maimon
We review André Luiz Barbosa's paper "P != NP Proof," in which the classes P and NP are generalized and claimed to be proven separate. We highlight inherent ambiguities in Barbosa'…
cs.CC2017
A Refutation of Guinea's "Understanding SAT is in P"
Jackson Abascal, Shir Maimon
In this work, we summarize and critique the paper "Understanding SAT is in P" by Alejandro Sánchez Guinea [arXiv:1504.00337]. The paper claims to present a polynomial-time solution…