What is he best known for?
The fields of study he is best known for:
- Algorithm
- Discrete mathematics
- Combinatorics
His primary scientific interests are in Discrete mathematics, Combinatorics, Theoretical computer science, Mathematical proof and Cryptography.
The various areas that Russell Impagliazzo examines in his Discrete mathematics study include Polynomial identity testing and Oracle.
His biological study spans a wide range of topics, including Forcing, Encryption, Pseudorandom function family and Obfuscation.
His Combinatorics study combines topics from a wide range of disciplines, such as Computational complexity theory, Upper and lower bounds and Exponential function.
His Theoretical computer science research incorporates themes from Security of cryptographic hash functions, Cryptographic protocol, Composition, Random oracle and Data science.
His study looks at the relationship between Mathematical proof and fields such as Algorithm, as well as how they intersect with chemical problems.
His most cited work include:
- A Pseudorandom Generator from any One-way Function (1372 citations)
- Which Problems Have Strongly Exponential Complexity (1126 citations)
- On the (Im)possibility of Obfuscating Programs (916 citations)
What are the main themes of his work throughout his whole career to date?
Russell Impagliazzo mainly investigates Discrete mathematics, Combinatorics, Upper and lower bounds, Theoretical computer science and Algorithm.
His Discrete mathematics research is multidisciplinary, relying on both Computational complexity theory, Mathematical proof and Circuit complexity.
His research integrates issues of Function, Polynomial and Exponential function in his study of Combinatorics.
His Polynomial research includes elements of Nondeterministic algorithm and Pseudorandomness.
The concepts of his Upper and lower bounds study are interwoven with issues in Conjecture, Complexity class, Approximation algorithm and Pigeonhole principle.
The Theoretical computer science study which covers Pseudorandom function family that intersects with Obfuscation.
He most often published in these fields:
- Discrete mathematics (57.59%)
- Combinatorics (48.66%)
- Upper and lower bounds (16.52%)
What were the highlights of his more recent work (between 2013-2021)?
- Discrete mathematics (57.59%)
- Combinatorics (48.66%)
- Upper and lower bounds (16.52%)
In recent papers he was focusing on the following fields of study:
The scientist’s investigation covers issues in Discrete mathematics, Combinatorics, Upper and lower bounds, Polynomial and Boolean function.
His Discrete mathematics study incorporates themes from Computational complexity theory, Algebraic number, Class, Exponential function and Entropy.
His studies link Nondeterministic algorithm with Combinatorics.
His Nondeterministic algorithm course of study focuses on Randomized algorithm and Pseudorandom generator.
His Upper and lower bounds research incorporates themes from Circuit complexity, Complexity class and Oracle.
His Boolean function study deals with Fourier analysis intersecting with Inequality, Elementary proof and Quadratic equation.
Between 2013 and 2021, his most popular works were:
- Nondeterministic Extensions of the Strong Exponential Time Hypothesis and Consequences for Non-reducibility (59 citations)
- AM with Multiple Merlins (27 citations)
- 0-1 Integer Linear Programming with a Linear Number of Constraints (26 citations)
In his most recent research, the most cited papers focused on:
- Algorithm
- Algebra
- Combinatorics
Russell Impagliazzo spends much of his time researching Combinatorics, Discrete mathematics, Upper and lower bounds, Polynomial and Complexity class.
His research in Combinatorics intersects with topics in Fourier analysis and Exponential function.
As a member of one scientific family, he mostly works in the field of Discrete mathematics, focusing on Exact algorithm and, on occasion, Linear number.
His work carried out in the field of Upper and lower bounds brings together such families of science as Algorithm, Circuit complexity and Class.
His Polynomial research is multidisciplinary, incorporating elements of Matching, Approximation algorithm, Binary logarithm and Boolean satisfiability problem.
His Complexity class research is multidisciplinary, incorporating perspectives in Oracle, Obfuscation and Special case.
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.
