Month: January 2021

Formula-Game: Using Game Theory to Analyze the Probabilistic Features of True Quantified Boolean Formulas

Note: I’ve written some code which I used to verify some of the results presented in this post–you can access it here. Last semester, I took a class on the theory of computation, where I learned about computational complexity and the so-called Complexity Zoo. One of the complexity classes we considered was PSPACE, the class …

Formula-Game: Using Game Theory to Analyze the Probabilistic Features of True Quantified Boolean Formulas Read More »