What is he best known for?
The fields of study he is best known for:
- Algorithm
- Combinatorics
- Computational complexity theory
His primary scientific interests are in Combinatorics, Discrete mathematics, 3SUM, Matrix multiplication and Circuit complexity.
The Combinatorics study combines topics in areas such as Matrix, NEXPTIME and Polynomial.
Ryan Williams combines subjects such as Upper and lower bounds and Longest common subsequence problem with his study of NEXPTIME.
Ryan Williams interconnects Time complexity and Circuit satisfiability problem in the investigation of issues within Polynomial.
His Discrete mathematics study combines topics in areas such as Computational complexity theory, Exponential function and Constant.
Ryan Williams has included themes like Binary logarithm and Randomized algorithm in his Circuit complexity study.
His most cited work include:
- On the complexity of optimal K-anonymity (690 citations)
- A new algorithm for optimal 2-constraint satisfaction and its implications (335 citations)
- Backdoors to typical case complexity (289 citations)
What are the main themes of his work throughout his whole career to date?
The scientist’s investigation covers issues in Combinatorics, Discrete mathematics, Circuit complexity, Time complexity and Algorithm.
He has researched Combinatorics in several fields, including Satisfiability, Polynomial and Matrix multiplication.
Ryan Williams works mostly in the field of Matrix multiplication, limiting it down to topics relating to Directed graph and, in certain cases, Path, as a part of the same area of interest.
His Discrete mathematics study integrates concerns from other disciplines, such as Computational complexity theory, NEXPTIME, Quadratic equation and Upper and lower bounds.
His Circuit complexity research incorporates themes from Boolean circuit, Boolean function, Complexity class, Nondeterministic algorithm and Function.
His work deals with themes such as Theoretical computer science, Exponential function, Constant, Symmetric function and Integer, which intersect with Algorithm.
He most often published in these fields:
- Combinatorics (63.82%)
- Discrete mathematics (53.29%)
- Circuit complexity (21.05%)
What were the highlights of his more recent work (between 2016-2021)?
- Combinatorics (63.82%)
- Discrete mathematics (53.29%)
- Binary logarithm (13.16%)
In recent papers he was focusing on the following fields of study:
Combinatorics, Discrete mathematics, Binary logarithm, Randomized algorithm and Algorithm are his primary areas of study.
His Combinatorics study combines topics from a wide range of disciplines, such as Function and Product.
His Discrete mathematics research is multidisciplinary, relying on both System of polynomial equations, Polynomial, Quadratic equation and Brute-force search.
His Binary logarithm research includes elements of Matching and Upper and lower bounds.
His Randomized algorithm research incorporates elements of Satisfiability and Deterministic algorithm.
His study on Algorithm also encompasses disciplines like
- Symmetric function that intertwine with fields like Linear programming,
- Integer, which have a strong connection to Constant.
Between 2016 and 2021, his most popular works were:
- Subcubic Equivalences Between Path, Matrix, and Triangle Problems (64 citations)
- Tight hardness for shortest cycles and paths in sparse graphs (35 citations)
- Distributed PCP Theorems for Hardness of Approximation in P (34 citations)
In his most recent research, the most cited papers focused on:
- Algorithm
- Combinatorics
- Computational complexity theory
Ryan Williams spends much of his time researching Combinatorics, Discrete mathematics, Matrix multiplication, Circuit complexity and Shortest path problem.
His work on Combinatorics deals in particular with Minimum weight, Complexity class, Exponential time hypothesis, Binary logarithm and Reduction.
Ryan Williams studies Discrete mathematics, namely Independent set.
His Matrix multiplication research includes themes of Multiplication, Logical matrix, Semiring and Conjecture.
His Circuit complexity study incorporates themes from Satisfiability and Nondeterministic algorithm.
In his work, Product is strongly intertwined with Graph algorithms, which is a subfield of Shortest path problem.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
