What is he best known for?
The fields of study he is best known for:
- Artificial intelligence
- Algorithm
- Programming language
Leslie G. Valiant spends much of his time researching Discrete mathematics, Combinatorics, Algebra, Time complexity and Theoretical computer science.
His work on Counting problem, Binary logarithm and PP as part of general Discrete mathematics research is often related to Polynomial identity testing, thus linking different fields of science.
His research in Combinatorics intersects with topics in Multiprocessing, Complete Boolean algebra and Product term.
Leslie G. Valiant has included themes like Deterministic finite automaton, Quadratic residue, Quantum complexity theory, Graph coloring and True quantified Boolean formula in his Algebra study.
His work deals with themes such as Turing machine, Set, Parallelism, Random graph and Parallel algorithm, which intersect with Time complexity.
Leslie G. Valiant interconnects Sorting, Model of computation, Complexity class and Boolean circuit in the investigation of issues within Theoretical computer science.
His most cited work include:
- A theory of the learnable (4315 citations)
- A bridging model for parallel computation (3150 citations)
- The complexity of computing the permanent (2285 citations)
What are the main themes of his work throughout his whole career to date?
His primary areas of study are Discrete mathematics, Combinatorics, Artificial intelligence, Theoretical computer science and Algorithm.
His study in Discrete mathematics is interdisciplinary in nature, drawing from both Computational complexity theory and Algebra.
The Concept class and Artificial neural network research he does as part of his general Artificial intelligence study is frequently linked to other disciplines of science, such as Context, therefore creating a link between diverse domains of science.
His Theoretical computer science research integrates issues from Computational learning theory and Boolean function.
His Algorithm research is multidisciplinary, incorporating perspectives in Polynomial and Robustness.
His Binary logarithm research is multidisciplinary, relying on both Randomized algorithm and Logarithm.
He most often published in these fields:
- Discrete mathematics (39.84%)
- Combinatorics (21.09%)
- Artificial intelligence (19.53%)
What were the highlights of his more recent work (between 2008-2020)?
- Artificial intelligence (19.53%)
- Algorithm (13.28%)
- Cognition (7.03%)
In recent papers he was focusing on the following fields of study:
Leslie G. Valiant mainly investigates Artificial intelligence, Algorithm, Cognition, Cortex and Combinatorics.
His Artificial intelligence study incorporates themes from Development, Science studies, Cognitive science, Machine learning and Computation.
His Computation study combines topics from a wide range of disciplines, such as Computational neuroscience, Random access, Turing and Knowledge acquisition.
His studies in Algorithm integrate themes in fields like Evolutionary algorithm, Polynomial and Stability.
His research on Combinatorics frequently links to adjacent areas such as Discrete mathematics.
His research investigates the connection between Time complexity and topics such as Planar graph that intersect with issues in Boolean function, Counting problem, Feedback vertex set and Computational complexity theory.
Between 2008 and 2020, his most popular works were:
- A bridging model for multi-core computing (137 citations)
- Probably Approximately Correct: Nature's Algorithms for Learning and Prospering in a Complex World (124 citations)
- The Complexity of Symmetric Boolean Parity Holant Problems (22 citations)
In his most recent research, the most cited papers focused on:
- Artificial intelligence
- Algorithm
- Programming language
His primary areas of investigation include Cognition, Algorithm, Combinatorics, Time complexity and Discrete mathematics.
In his study, which falls under the umbrella issue of Cognition, Artificial intelligence is strongly linked to Biological neural network.
His Artificial intelligence research includes elements of Memorization, Association, Learning theory and Neuroscience.
His work is connected to Computational complexity theory, Boolean function, Counting problem and Vertex cover, as a part of Algorithm.
His Homomorphism, Undirected graph and Vertex study, which is part of a larger body of work in Combinatorics, is frequently linked to Constraint satisfaction problem and Subclass, bridging the gap between disciplines.
Leslie G. Valiant combines topics linked to Feedback vertex set with his work on Time complexity.
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.
