What is he best known for?
The fields of study he is best known for:
- Combinatorics
- Algebra
- Discrete mathematics
Alexander A. Razborov spends much of his time researching Discrete mathematics, Combinatorics, Upper and lower bounds, Boolean function and Bounded function.
His Discrete mathematics research focuses on Proof complexity and how it relates to Degree.
His research in the fields of Graph and Hypergraph overlaps with other disciplines such as Edge density.
His Upper and lower bounds research is multidisciplinary, relying on both Measure, Simple, Probability of error and Communication complexity.
His Boolean function study integrates concerns from other disciplines, such as Function, Uniform boundedness, Peano axioms and Order theory.
His work carried out in the field of Bounded function brings together such families of science as Basis, Electronic circuit, Pure mathematics, Lemma and ACC0.
His most cited work include:
- On the distributional complexity of disjointness (451 citations)
- Natural Proofs (351 citations)
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition (332 citations)
What are the main themes of his work throughout his whole career to date?
His primary areas of investigation include Combinatorics, Discrete mathematics, Upper and lower bounds, Proof complexity and Boolean function.
His study looks at the relationship between Combinatorics and topics such as Omega, which overlap with Double exponential function and Space.
His study in Discrete mathematics is interdisciplinary in nature, drawing from both Mathematical proof, Bounded function, Exponential function and Propositional proof system.
The study incorporates disciplines such as Polynomial, Class, Arbitrarily large, Function and Sequence in addition to Exponential function.
His Upper and lower bounds research includes elements of Matrix, Logarithm and Communication complexity.
His Proof complexity research is multidisciplinary, incorporating perspectives in Proof theory, Degree, Propositional calculus, Resolution and Algorithm.
He most often published in these fields:
- Combinatorics (72.78%)
- Discrete mathematics (58.23%)
- Upper and lower bounds (27.22%)
What were the highlights of his more recent work (between 2017-2021)?
- Combinatorics (72.78%)
- Conjecture (15.82%)
- Graph (11.39%)
In recent papers he was focusing on the following fields of study:
The scientist’s investigation covers issues in Combinatorics, Conjecture, Graph, Ramsey theory and Independence number.
His Combinatorics research incorporates themes from Double exponential function and Omega.
His Double exponential function study combines topics in areas such as Strongly regular graph, Flag, Variety, Regular graph and Function.
He combines subjects such as Binary logarithm and Negative - answer with his study of Omega.
Alexander A. Razborov has included themes like Hypergraph and Mathematical proof in his Graph study.
His Ramsey theory research is multidisciplinary, incorporating elements of Polynomial, Sequence, Arbitrarily large and Exponential function.
Between 2017 and 2021, his most popular works were:
- Clique is hard on average for regular resolution (15 citations)
- Polynomial to exponential transition in Ramsey theory (4 citations)
- Polynomial to exponential transition in Ramsey theory (4 citations)
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.
