- Home
- Best Scientists - Mathematics
- Alexander A. Razborov

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Mathematics
D-index
40
Citations
7,466
112
World Ranking
1366
National Ranking
618

Computer Science
D-index
40
Citations
7,457
110
World Ranking
5771
National Ranking
2800

2020 - Fellow of the American Academy of Arts and Sciences

1993 - Member of Academia Europaea

1990 - Rolf Nevanlinna Prize

- 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.

- 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)

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.

- Combinatorics (72.78%)
- Discrete mathematics (58.23%)
- Upper and lower bounds (27.22%)

- Combinatorics (72.78%)
- Conjecture (15.82%)
- Graph (11.39%)

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.

- 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.

On the distributional complexity of disjointness

A. A. Razborov.

Theoretical Computer Science **(1992)**

798 Citations

On the distributional complexity of disjointness

A. A. Razborov.

Theoretical Computer Science **(1992)**

798 Citations

Natural Proofs

Alexander A Razborov;Steven Rudich.

conference on learning theory **(1997)**

694 Citations

Natural Proofs

Alexander A Razborov;Steven Rudich.

conference on learning theory **(1997)**

694 Citations

Lower bounds on the size of bounded depth circuits over a complete basis with logical addition

A. A. Razborov.

Mathematical Notes **(1987)**

534 Citations

Lower bounds on the size of bounded depth circuits over a complete basis with logical addition

A. A. Razborov.

Mathematical Notes **(1987)**

534 Citations

On the minimal density of triangles in graphs

Alexander a. Razborov.

Combinatorics, Probability & Computing **(2008)**

315 Citations

On the minimal density of triangles in graphs

Alexander a. Razborov.

Combinatorics, Probability & Computing **(2008)**

315 Citations

Majority gates vs. general weighted threshold gates

M. Goldmann;J. Hastad;A. Razborov.

structure in complexity theory annual conference **(1992)**

297 Citations

Majority gates vs. general weighted threshold gates

M. Goldmann;J. Hastad;A. Razborov.

structure in complexity theory annual conference **(1992)**

297 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Institute for Advanced Study

University of Washington

Technion – Israel Institute of Technology

University of California, Berkeley

University of Toronto

Tsinghua University

University of California, San Diego

University of Toronto

Technion – Israel Institute of Technology

RWTH Aachen University

RuleQuest Research

AGH University of Science and Technology

University of Córdoba

Sun Yat-sen University

Hannover Medical School

University of California, Irvine

University of Florence

Zhejiang University

University of Aberdeen

University of Amsterdam

Harvard University

Mayo Clinic

University of Colorado Boulder

Lenox Hill Hospital

University of Waterloo

State University of Campinas

Something went wrong. Please try again later.