activity
20162026
most citedLimits on representing Boolean functions by linear combinations of simple functions: thresholds, ReLUs, and low-degree polynomials

10 citations · 14 across the 10 of their papers we have counts for

collaborators

12 papers

cs.CR2026

Automated Template-free Synthesis of Instruction-Centric Leakage Contracts for Black-Box CPUs

Elvira Moreno, Tiziano Marinaro, Ryan Williams +4

Side-channel attacks pose a significant security threat for modern computing platforms, because they exploit subtle discrepancies in CPU behaviors to leak sensitive information. To…

cs.CC2026

Near-Maximum Circuit Lower Bounds for Exponential Time with Merlin-Arthur Queries

Hanlin Ren, Ryan Williams

We prove a near-maximum () circuit lower bound for the complexity class , corresponding to exponential time with access to a promis…

cs.DS2026

Beating Trivial Time for Tricky Triangle Tasks

Neha Pant, Ryan Williams

For several well-studied triangle detection problems in the literature, the trivial enumeration algorithms are known to be optimal (up to the exponent) assuming popular fine-graine…

cs.CC2025

Simulating Time With Square-Root Space

R. Ryan Williams

We show that for all functions , every multitape Turing machine running in time can be simulated in space only . This is a substantial improvem…

cs.AI2024

Reframing the Mind-Body Picture: Applying Formal Systems to the Relationship of Mind and Matter

Ryan Williams

This paper aims to show that a simple framework, utilizing basic formalisms from set theory and category theory, can clarify and inform our theories of the relation between mind an…

cs.LO2024

Parallel Play Saves Quantifiers

Marco Carmosino, Ronald Fagin, Neil Immerman +4

The number of quantifiers needed to express first-order properties is captured by two-player combinatorial games called multi-structural (MS) games. We play these games on linear o…