What is he best known for?
The fields of study he is best known for:
- Algorithm
- Combinatorics
- Statistics
His primary areas of investigation include Combinatorics, Discrete mathematics, Computational complexity theory, Upper and lower bounds and Algorithm.
His research investigates the connection between Combinatorics and topics such as Constraint satisfaction problem that intersect with problems in 2-satisfiability.
His Discrete mathematics study integrates concerns from other disciplines, such as Theory of computation and Nash equilibrium.
His study in the field of Complexity class is also linked to topics like #SAT.
In his research, Martingale is intimately related to Load balancing, which falls under the overarching field of Upper and lower bounds.
The concepts of his Algorithm study are interwoven with issues in Distributed algorithm, Logarithm, Value and Parallel computing.
His most cited work include:
- On the relative complexity of approximate counting problems (173 citations)
- A Complexity Dichotomy for Partition Functions with Mixed Signs (101 citations)
- Computational complexity of weighted threshold games (99 citations)
What are the main themes of his work throughout his whole career to date?
His main research concerns Combinatorics, Discrete mathematics, Bipartite graph, Time complexity and Counting problem.
His research in Combinatorics intersects with topics in Bounded function, Markov chain and Constraint satisfaction problem.
His study in the field of Complexity class and Tutte polynomial also crosses realms of #SAT and Partition function.
His Bipartite graph research includes elements of Independent set, Unary operation, Trichotomy, Algorithm and Potts model.
Leslie Ann Goldberg has researched Time complexity in several fields, including Tree, Polynomial and Ising model.
The various areas that Leslie Ann Goldberg examines in his Counting problem study include Computational complexity theory, Graph and Approximation algorithm.
He most often published in these fields:
- Combinatorics (66.91%)
- Discrete mathematics (40.07%)
- Bipartite graph (17.65%)
What were the highlights of his more recent work (between 2015-2021)?
- Combinatorics (66.91%)
- Discrete mathematics (40.07%)
- Bipartite graph (17.65%)
In recent papers he was focusing on the following fields of study:
Leslie Ann Goldberg mainly investigates Combinatorics, Discrete mathematics, Bipartite graph, Degree and Bounded function.
Leslie Ann Goldberg combines topics linked to Constraint satisfaction problem with his work on Combinatorics.
Leslie Ann Goldberg performs integrative study on Discrete mathematics and Partition function.
His Bipartite graph research incorporates themes from Algorithm, Polynomial and Partition function.
His research on Bounded function also deals with topics like
- Function together with Boolean function, Class and Hypergraph,
- Approximation algorithm that intertwine with fields like Computation.
The Counting problem study combines topics in areas such as Trichotomy and Complexity class.
Between 2015 and 2021, his most popular works were:
- The Complexity of Approximating complex-valued Ising and Tutte partition functions (34 citations)
- #BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region (27 citations)
- Approximately Counting $H$-Colorings is $#\mathrm{BIS}$-Hard (13 citations)
In his most recent research, the most cited papers focused on:
- Combinatorics
- Algorithm
- Statistics
The scientist’s investigation covers issues in Combinatorics, Discrete mathematics, Bipartite graph, Degree and Independent set.
His Combinatorics study combines topics from a wide range of disciplines, such as Complex plane, Exponential function and Moran process.
His study explores the link between Discrete mathematics and topics such as Tree that cross with problems in Resampling.
His Bipartite graph research is multidisciplinary, relying on both Partition function, Time complexity, Algorithm, Counting problem and Polynomial.
His Counting problem research is multidisciplinary, incorporating perspectives in Trichotomy, Permutation graph, Interval graph and Computational complexity theory.
In his research on the topic of Degree, Matching polynomial, Dense set, Geodesic, Metric and Real number is strongly related with Bounded function.
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.
