A Fine-Grained Analogue of Schaefer's Theorem in P
Explore an advanced analysis of computational complexity, examining a fine-grained analogue of Schaefer's Theorem to delineate the boundaries of polynomial-time solvability.
Researcher
Self-contained public lectures, keynote addresses, and research seminars.
Explore an advanced analysis of computational complexity, examining a fine-grained analogue of Schaefer's Theorem to delineate the boundaries of polynomial-time solvability.