I work in algorithm design and complexity theory, and i especially like connections between the two subjects The main idea is to first relativize theorem 1.1 to allow parallel access to an np oracle both in the upper bound and in the uniformity bound, and then to strengthen the upper bound using an idea of fortnow, santhanam and williams [fsw09]. I think about many questions, but a few of them haunt me more than others
Lindsay Capuano on Twitter: "Which one is your favorite 1 or 2? 🌴🛁…
Can the existence of an algorithm.
Faster detours in undirected graphs [lipics] in 31st annual european symposium on algorithms (esa 2023)
Richard ryan williams mit csail, 32 vassar st., cambridge, ma 02139 email If you are unable to submit your homework because of extenuating circumstances such as a family/medical emergency, please have s^3 contact ryan or the tas about it (asap). To illustrate, applying known algorithms for satisfiability of acc thr circuits [r
