The following pages link to Ryan Williams (Q937200):
Displaying 50 items.
- (Q354643) (redirect page) (← links)
- Amplifying circuit lower bounds against polynomial time, with applications (Q354644) (← links)
- On uniformity and circuit lower bounds (Q488049) (← links)
- Limits on alternation trading proofs for time-space lower bounds (Q496301) (← links)
- An improved time-space lower bound for tautologies (Q652633) (← links)
- Time-space tradeoffs for counting NP solutions modulo integers (Q937201) (← links)
- Finding paths of length \(k\) in \(O^{*}(2^k)\) time (Q976105) (← links)
- Some estimated likelihoods for computational complexity (Q2075760) (← links)
- On super strong ETH (Q2181948) (← links)
- Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants (Q2272599) (← links)
- Parallelizing time with polynomial circuits (Q2429726) (← links)
- Inductive time-space lower bounds for SAT and related problems (Q2460033) (← links)
- A new algorithm for optimal 2-constraint satisfaction and its implications (Q2581276) (← links)
- Lower bounds against sparse symmetric functions of ACC circuits: expanding the reach of \#SAT algorithms (Q2701071) (← links)
- Natural proofs versus derandomization (Q2805512) (← links)
- Finding, minimizing, and counting weighted subgraphs (Q2848203) (← links)
- Improving exhaustive search implies superpolynomial lower bounds (Q2848219) (← links)
- Improving exhaustive search implies superpolynomial lower bounds (Q2875149) (← links)
- Improved Parameterized Algorithms for above Average Constraint Satisfaction (Q2891342) (← links)
- Regularity lemmas and combinatorial algorithms (Q2913804) (← links)
- Losing Weight by Gaining Edges (Q2921387) (← links)
- Finding heaviest <i>H</i> -subgraphs in real weighted graphs, with applications (Q2930324) (← links)
- Finding a maximum weight triangle in n <sup>3-Δ</sup> time, with applications (Q2931387) (← links)
- (Q2934692) (← links)
- Alternation-Trading Proofs, Linear Programming, and Lower Bounds (Q2947580) (← links)
- Massive online teaching to bounded learners (Q2986853) (← links)
- The Circuit-Input Game, Natural Proofs, and Testing Circuits With Data (Q2989039) (← links)
- (Q3002808) (← links)
- Diagonalization Strikes Back: Some Recent Lower Bounds in Complexity Theory (Q3087953) (← links)
- Alternation-trading proofs, linear programming, and lower bounds (extended abstract) (Q3113789) (← links)
- Nonuniform ACC Circuit Lower Bounds (Q3189637) (← links)
- The polynomial method in circuit complexity applied to algorithm design (invited talk) (Q3299223) (← links)
- A New Combinatorial Approach for Sparse Graph Problems (Q3521912) (← links)
- (Q3549658) (← links)
- Confronting hardness using a hybrid approach (Q3581485) (← links)
- Resolving the Complexity of Some Data Privacy Problems (Q3587455) (← links)
- Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems (Q3613765) (← links)
- Limits and Applications of Group Algebras for Parameterized Problems (Q3638070) (← links)
- Faster All-Pairs Shortest Paths via Circuit Complexity (Q4554074) (← links)
- Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky (Q4575668) (← links)
- Completeness for First-Order Properties on Sparse Structures with Algorithmic Applications (Q4575889) (← links)
- Faster Online Matrix-Vector Multiplication (Q4575890) (← links)
- Beating Brute Force for Systems of Polynomial Equations over Finite Fields (Q4575891) (← links)
- (Q4589023) (← links)
- (Q4598197) (← links)
- On the (non) NP-hardness of computing circuit complexity (Q4601837) (← links)
- (Q4607966) (← links)
- (Q4607968) (← links)
- New algorithms and lower bounds for circuits with linear threshold gates (Q4612481) (← links)
- Subcubic Equivalences Between Path, Matrix, and Triangle Problems (Q4625648) (← links)
