Computational Complexity

12.4k citations
633 papers · · active since 1991

Impact in

Papers in

Computational Complexity

587 papers receiving 11.4k citations

Peers

Computational Complexity
Comparison fields: 5 of 132
  • Computational Theory and Mathematics 8.2k
  • Discrete Mathematics and Combinatorics 827
  • Artificial Intelligence 3.9k
  • Computational Mathematics 56
  • Algebra and Number Theory 136
Replace Applicable Algebra in Engineering Communication and Computing with:
Applicable Algebra in Engineering Communication and Computing United States
ACM Transactions on Algorithms United States
Notices of the American Mathematical Society United States
RAIRO - Theoretical Informatics and Applications France
Electronic Journal of Linear Algebra United States
Order United States
Journal of Cryptology United States
Journal of Discrete Algorithms United States
Journal of Classification United States
Annals of Combinatorics United States
Computational Complexity relative to Applicable Algebra in Engineering Communication and Computing United States Applicable Algebra in Engineering Communication and Computing's profile →
Citations per field
00.5×2×4×6.2×
Applicable Algebra in Engineering Communication and Computing · 1×
Citations per year

Countries where authors publish in Computational Complexity

Since Specialization
Citations

This map shows the geographic impact of research published in Computational Complexity. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by papers published in Computational Complexity with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Computational Complexity more than expected).

Fields of papers published in Computational Complexity

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers published in Computational Complexity. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers published in Computational Complexity.

About Computational Complexity

The 633 papers published in Computational Complexity in the last decades have received a total of 12.4k indexed citations . Papers published in Computational Complexity usually cover Computational Theory and Mathematics (506 papers), Discrete Mathematics and Combinatorics (31 papers), Computational Mathematics (4 papers), Artificial Intelligence (121 papers) and Statistical and Nonlinear Physics (19 papers) specifically the topics of Complexity and Algorithms in Graphs (410 papers), Computability, Logic, AI Algorithms (60 papers), Polynomial and algebraic computation (60 papers), Advanced Graph Theory Research (50 papers), Quantum Computing Algorithms and Architecture (36 papers), Cryptography and Data Security (33 papers), Cellular Automata and Applications (25 papers) and Coding theory and cryptography (24 papers). The most active scholars publishing in Computational Complexity are Lance Fortnow, László Babai, Noam Nisan, Avi Wigderson, Carsten Lund, Russell Impagliazzo, Richard Beigel, Ran Raz, Alexander Alexandrovich Razborov and Emanuele Viola.

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore journals with similar magnitude of impact