What is he best known for?
The fields of study he is best known for:
- Algorithm
- Discrete mathematics
- Combinatorics
Avi Wigderson focuses on Discrete mathematics, Combinatorics, Theoretical computer science, Mathematical proof and Upper and lower bounds.
The Discrete mathematics study combines topics in areas such as Turing machine, Computational complexity theory, Zero-knowledge proof, Randomness and String.
His studies deal with areas such as Monotone polygon, Communication complexity and Exponential function as well as Combinatorics.
His work carried out in the field of Theoretical computer science brings together such families of science as Cryptographic protocol, Cryptography, Fault tolerance, Completeness and Secure two-party computation.
His Interactive proof system, Probabilistically checkable proof and Proof complexity study in the realm of Mathematical proof connects with subjects such as Generality.
His Upper and lower bounds research integrates issues from Probabilistic analysis of algorithms, Randomized algorithm, Game theory and Deterministic algorithm.
His most cited work include:
- How to play ANY mental game (2707 citations)
- Completeness theorems for non-cryptographic fault-tolerant distributed computation (2019 citations)
- How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority (1655 citations)
What are the main themes of his work throughout his whole career to date?
The scientist’s investigation covers issues in Discrete mathematics, Combinatorics, Upper and lower bounds, Theoretical computer science and Mathematical proof.
Avi Wigderson interconnects Function, Polynomial and Computational complexity theory in the investigation of issues within Discrete mathematics.
The various areas that Avi Wigderson examines in his Polynomial study include Commutative property and Algebraic number.
His Combinatorics research focuses on subjects like Rank, which are linked to Matrix.
His Theoretical computer science study frequently draws connections between related disciplines such as Cryptography.
His Mathematical proof study frequently links to adjacent areas such as Simple.
He most often published in these fields:
- Discrete mathematics (57.58%)
- Combinatorics (49.76%)
- Upper and lower bounds (17.06%)
What were the highlights of his more recent work (between 2013-2021)?
- Discrete mathematics (57.58%)
- Combinatorics (49.76%)
- Polynomial (10.19%)
In recent papers he was focusing on the following fields of study:
His main research concerns Discrete mathematics, Combinatorics, Polynomial, Mathematical proof and Time complexity.
Avi Wigderson is studying Boolean circuit, which is a component of Discrete mathematics.
His Combinatorics study incorporates themes from Point and Block code.
His studies examine the connections between Polynomial and genetics, as well as such issues in Tensor, with regards to Arithmetic.
His work deals with themes such as Simple, Bounded function and Theoretical computer science, which intersect with Mathematical proof.
His Time complexity research incorporates elements of Commutative property, Algebra, Invariant theory and Quantum information.
Between 2013 and 2021, his most popular works were:
- How to play any mental game, or a completeness theorem for protocols with honest majority (331 citations)
- A Deterministic Polynomial Time Algorithm for Non-commutative Rational Identity Testing (59 citations)
- Much Faster Algorithms for Matrix Scaling (43 citations)
In his most recent research, the most cited papers focused on:
- Algorithm
- Algebra
- Combinatorics
Avi Wigderson mostly deals with Discrete mathematics, Combinatorics, Time complexity, Commutative property and Invariant theory.
His Discrete mathematics research integrates issues from Field, Matrix and Rank.
Avi Wigderson combines subjects such as Point and Upper and lower bounds with his study of Combinatorics.
His research investigates the link between Time complexity and topics such as Algebra that cross with problems in Computational complexity theory and Polytope.
Avi Wigderson has included themes like Polynomial, Operator and Convex optimization in his Commutative property study.
His Invariant theory study also includes
- Polynomial identity testing, which have a strong connection to Randomized algorithm,
- Linear algebra together with Identity testing and Quantum information.
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.
