Marcus Schaefer

Marcus Schaefer is a computer scientist and mathematician known for his work in computational complexity theory and automata theory. His research has focused particularly on complexity classes, formal languages, and Boolean satisfiability problems. As a professor at DePaul University's School of Computing, Schaefer has made significant contributions to theoretical computer science, including work on graph coloring problems and computational complexity classifications. His paper "The Complexity of Satisfiability Problems" is frequently cited in the field. Schaefer's textbook "Mathematical Logic" is used in undergraduate and graduate computer science programs, covering propositional logic, first-order logic, and their applications to computer science. He has also published extensively on topics including graph theory, constraint satisfaction problems, and computational complexity theory. Together with Christopher Umans, Schaefer developed important results regarding the complexity of graph homomorphism problems, which have applications in database theory and artificial intelligence.

Marcus Schaefer's work receives attention primarily from computer science students and academics. Reviews focus mainly on his textbook "Mathematical Logic." What readers liked: - Clear explanations of complex mathematical concepts - Logical progression from basic to advanced topics - Helpful examples and exercises throughout - Appropriate balance of theory and application - Comprehensive coverage of propositional and first-order logic What readers disliked: - Dense mathematical notation can be challenging for beginners - Some sections require more background knowledge than stated - Limited solutions provided for practice problems - Physical textbook quality issues (binding, print size) Ratings summary: - Goodreads: 4.1/5 (limited sample size) - Amazon: 4.2/5 based on 12 reviews - Positive mentions on computer science forums and academic discussion boards One student reviewer noted: "The proofs are presented step-by-step, making difficult concepts digestible." Another commented: "Could use more introductory material before diving into formal notation." Note: Limited public reviews available due to academic/technical nature of works.

Crossing Numbers of Graphs (2018) A comprehensive examination of graph theory focusing on crossing numbers, including fundamental theorems, computational complexity, and applications in graph drawing algorithms.

Mathematical Logic (2017) A textbook covering the foundations of mathematical logic from propositional calculus through first-order logic, with connections to computer science and complexity theory.

Lance Fortnow His book "The Golden Ticket: P, NP, and the Search for the Impossible" explores computational complexity in depth for both technical and general audiences. His research focuses on computational complexity theory and the P versus NP problem, closely aligned with Schaefer's work.

Christos Papadimitriou His textbook "Computational Complexity" is a foundational text in complexity theory that covers many topics parallel to Schaefer's research. He has made fundamental contributions to complexity theory, algorithms, and computational biology throughout his career.

Michael Sipser His book "Introduction to the Theory of Computation" presents automata theory and computational complexity with mathematical rigor similar to Schaefer's approach. His research in complexity theory and interactive proof systems connects directly to Schaefer's work in computational complexity.

Richard Karp His work on NP-completeness and complexity theory laid groundwork that Schaefer built upon in his research on satisfiability problems. His contributions to algorithmic graph theory align with Schaefer's work on graph coloring and homomorphism problems.

Donald Knuth His series "The Art of Computer Programming" contains deep analysis of algorithms and computational complexity that complements Schaefer's theoretical work. His mathematical approach to computer science mirrors Schaefer's focus on formal logic and rigorous proofs.