Michael P. Reidy

collaborators

2 papers

cs.CC2024

A Critique of Chen's "The 2-MAXSAT Problem Can Be Solved in Polynomial Time"

Tran Duy Anh Le, Michael P. Reidy, Eliot J. Smith

In this paper, we examine Yangjun Chen's technical report titled ``The 2-MAXSAT Problem Can Be Solved in Polynomial Time'' [Che23], which revises and expands upon their conference…

cs.CC2023

On Czerwinski's " $P \neq = NP$ relative to a $P$ -complete oracle"

Michael C. Chavrimootoo, Tran Duy Anh Le, Michael P. Reidy +1

In this paper, we take a closer look at Czerwinski's " $P \neq = NP$ relative to a $P$ -complete oracle" [Cze23]. There are (uncountably) infinitely-many relativized wo…

A Critique of Chen's "The 2-MAXSAT Problem Can Be Solved in Polynomial Time"

On Czerwinski's "P=NP relative to a P-complete oracle"

On Czerwinski's " $P \neq = NP$ relative to a $P$ -complete oracle"