Academic: Past Teaching: Research Interests In general, I try to understand what is easy and what is hard to compute, independently of any particular computer. I work in algorithm design …

S. Akmal, V. Vassilevska Williams, R. R. Williams, Z. Xu. Faster Detours in Undirected Graphs [LIPIcs] In 31st Annual European Symposium on Algorithms (ESA 2023). Summary: In this …

Richard Ryan Williams MIT CSAIL, 32 Vassar St., Cambridge, MA 02139 Email: [email protected]

other results, our simulation implies that bounded fan-in circuits of size s can be evaluated on any input in only s · poly(log s) space, and that there are explicit problems solvable in O(n) space …

Instructor: Ryan Williams, Office 32-G638, Email rrw@mit Office Hours Wednesday 3-4pm, and by appointment TAs: Ce Jin, Email cejin@mit, Office Hours Wednesday 10-12 24-319 Timothy …

R. Santhanam and R. Williams, “On medium-uniformity and circuit lower bounds,” in Proceedings of the 28th Conference on Computational Complexity, 2013, pp. 15–23.

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. Williams, STOC 2014] we conclude that for every fixed k, NQP does not have nlogkn-size ACC THR circuits.

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 …

A new algorithm for optimal constraint satisfaction and its implications Ryan Williams∗ Computer Science Department Carnegie Mellon University Pittsburgh, PA 15213 Abstract