Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion
What makes normalized weighted satisfiability tractable
Why Linear Programming cannot solve large instances of NP-complete problems in polynomial time
Why Philosophers Should Care About Computational Complexity
Width-parameterized SAT: Time-Space Tradeoffs