World's Best Scientists 2026 revealed!
Alexander A. Razborov

Alexander A. Razborov

D-Index & Metrics

Computer Science

D-Index
45
Citations
8356
World Ranking
7196
National Ranking
3143

Mathematics

D-Index
46
Citations
8411
World Ranking
1362
National Ranking
607

Research.com Recognitions

  • 2020 - Fellow of the American Academy of Arts and Sciences
  • 1993 - Member of Academia Europaea
  • 1990 - Rolf Nevanlinna Prize

Overview

Alexander A. Razborov is affiliated with the University of Chicago in the United States. Their research primarily spans the fields of Computer Science and Mathematics, with significant contributions in subfields including Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Artificial Intelligence, Geometry and Topology, as well as History and Philosophy of Science.

The scientist's work covers a range of topics, particularly focused on graph theory and logic. The main topics of their research include:

  • Advanced Graph Theory Research
  • Limits and Structures in Graph Theory
  • Graph theory and applications
  • Logic, programming, and type systems
  • Formal Methods in Verification
  • Logic, Reasoning, and Knowledge
  • Graph Labeling and Dimension Problems

Frequent coauthors contributing to these findings are Leonardo N. Coregliano, V. S. Atabekyan, Lev D. Beklemishev, V. S. Guba, and Igor Lysenok.

Razborov has published extensively in respected venues. The most common outlets for their publications include:

  • arXiv (Cornell University)
  • Успехи математических наук
  • Russian Mathematical Surveys
  • Lecture notes in computer science
  • Random Structures and Algorithms

Their recent published papers encompass both theoretical and applied aspects, including:

  • "Семантические пределы плотных комбинаторных объектов" (2020), Успехи математических наук
  • "On CDCL-Based Proof Systems with the Ordered Decision Strategy" (2022), Lecture notes in computer science
  • "Natural quasirandomness properties" (2023), Random Structures and Algorithms
  • "Space characterizations of complexity measures and size-space trade-offs in propositional proof systems" (2023), Journal of Computer and System Sciences
  • "An extremal problem motivated by triangle-free strongly regular graphs" (2022), Journal of Combinatorial Theory Series B

Alexander A. Razborov's contributions have been recognized through several awards. They became a Member of Academia Europaea in 1993, received the Rolf Nevanlinna Prize in 1990, and were named a Fellow of the American Academy of Arts and Sciences in 2020.

Best Publications

  • On the distributional complexity of disjointness

    A. A. Razborov

  • Natural Proofs

    Alexander A Razborov;Steven Rudich

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

    A. A. Razborov

  • On the minimal density of triangles in graphs

    Alexander a. Razborov

  • Majority gates vs. general weighted threshold gates

    M. Goldmann;J. Hastad;A. Razborov

  • Quantum communication complexity of symmetric predicates

    Alexander Razborov

  • ON SYSTEMS OF EQUATIONS IN A FREE GROUP

    A A Razborov

  • On lower bounds for read- k -times branching programs

    A. Borodin;A. Razborov;R. Smolensky

  • Space Complexity in Propositional Calculus

    Michael Alekhnovich;Eli Ben-Sasson;Alexander A. Razborov;Avi Wigderson

  • Lower bounds for the polynomial calculus

    Alexander A. Razborov

  • Why are there so many loop formulas

    Vladimir Lifschitz;Alexander Razborov

  • Lower Bounds for Deterministic and Nondeterministic Branching Programs

    Alexander A. Razborov

  • On the number of pentagons in triangle-free graphs

    Hamed Hatami;Jan Hladký;Daniel KráL;Serguei Norine

  • Applications of matrix methods to the theory of lower bounds in computational complexity

    Alexander A. Razborov

  • On 3-Hypergraphs with Forbidden 4-Vertex Configurations

    Alexander A. Razborov

  • On provably disjoint NP-pairs

    Alexander A. Razborov

  • Bounded Arithmetic and Lower Bounds in Boolean Complexity

    Alexander A. Razborov

  • Proof complexity in algebraic systems and bounded depth Frege systems with modular counting

    S. Buss;R. Impagliazzo;J. Krajíček;P. Pudlák

  • Lower bounds for polynomial calculus: non-binomial case

    M. Alekhnovich;A.A. Razborov

  • Lower bounds on monotone complexity of the logical permanent

    A. A. Razborov

  • Unprovability of lower bounds on circuit size in certain fragments of bounded arithmetic

    A A Razborov

  • Space complexity in propositional calculus

    Michael Alekhnovich;Eli Ben-Sasson;A Alexander;Avi Wigderson

  • Complexity of propositional proofs

    Alexander Razborov

Frequent Co-Authors

Avi Wigderson
Avi Wigderson Institute for Advanced Study
Venkatesan Guruswami
Venkatesan Guruswami University of California, Berkeley
Eli Ben-Sasson
Eli Ben-Sasson Technion – Israel Institute of Technology
James R. Lee
James R. Lee University of Washington
Andrew Chi-Chih Yao
Andrew Chi-Chih Yao Tsinghua University
Toniann Pitassi
Toniann Pitassi Columbia University
Sergey Yekhanin
Sergey Yekhanin Microsoft (United States)
Allan Borodin
Allan Borodin University of Toronto
Samuel R. Buss
Samuel R. Buss University of California, San Diego
Daniel Král
Daniel Král Masaryk University

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

Report an issue

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:

Related Online Degrees & Career Pathways

For students pursuing Mathematics in the USA, exploring related online degrees can broaden career opportunities. Fields such as business administration, finance, marketing, and data analytics greatly benefit from strong quantitative and analytical skills developed in math programs.

Many professionals opt for a dba online programs to deepen their knowledge in business management while leveraging their mathematical background for strategic decision-making. Similarly, a masters in finance online programs are ideal for those interested in financial modeling and risk analysis, combining financial theory with quantitative techniques.

For students eager to accelerate their business careers, the quickest online mba programs offer flexible and efficient pathways to executive roles. Additionally, a master's degree in marketing provides an excellent route for those interested in leveraging data analytics and consumer behavior insights into practical marketing strategies.

By considering these related degrees, mathematics graduates can enhance their skill sets and increase their competitiveness in various high-demand industries.

Best Scientists Citing Alexander A. Razborov

Trending Scientists