Which Problems Have Strongly Exponential Complexity?

Abstract

loading...

About

This paper, published in 1950, received 536 indexed citations. Written by Russell Impagliazzo, Ramamohan Paturi and Francis Zane covering the research area of Computational Theory and Mathematics and Artificial Intelligence. It is primarily cited by scholars working on Computational Theory and Mathematics (472 citations), Computer Networks and Communications (183 citations) and Artificial Intelligence (107 citations). Published in Journal of Computer and System Sciences.

Countries where authors are citing Which Problems Have Strongly Exponential Complexity?

Since Specialization
Citations

This map shows the geographic impact of Which Problems Have Strongly Exponential 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 Which Problems Have Strongly Exponential Complexity? with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Which Problems Have Strongly Exponential Complexity? more than expected).

Fields of papers citing Which Problems Have Strongly Exponential Complexity?

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of Which Problems Have Strongly Exponential Complexity?. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the Which Problems Have Strongly Exponential Complexity?.

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.

This paper is also available at doi.org/10.1006/jcss.2001.1774.

Explore hit-papers with similar magnitude of impact

Rankless by CCL
2026