3 papers
cs.CC2021
On Lev Gordeev's "On P Versus NP"
David Narváez, Patrick Phillips
In the paper "On P versus NP," Lev Gordeev attempts to extend the method of approximation, which successfully proved exponential lower bounds for monotone circuits, to the case of…
cs.CC2021
On Salum's Algorithm for
Arian Nadjimzadah, David E. Narváez
This is a commentary on, and critique of, Latif Salum's paper titled "Tractability of One-in-three : ." Salum purports to give a polynomial…
cs.CY2020
Effective Feedback for Introductory CS Theory: A JFLAP Extension and Student Persistence
Ivona Bezáková, Kimberly Fluet, Edith Hemaspaandra +2
Computing theory analyzes abstract computational models to rigorously study the computational difficulty of various problems. Introductory computing theory can be challenging for u…