Search everything
Home
Research Intelligence
Expert Finder
Scinapse Trends
Paper Search
Journal Search
Collections
Favorites
History
Submit Feedback
doi.org/10.1006/jcss.2001.1774
Original paper
Which Problems Have Strongly Exponential Complexity?
Russell Impagliazzo
40
,
Ramamohan Paturi
1
,
Francis Zane
1
View all 3 authors
Journal of Computer and System Sciences
Volume: 63, Issue: 4, Pages: 512 - 530
Published
: Dec 1, 2001
731
Citations
Source
Cite
Basic Info
Analytics
References
Citations
Paper Fields
Discrete mathematics
Complexity class
Time complexity
Upper and lower bounds
Mathematics
Exponential function
Mathematical analysis
Combinatorics
Paper Details
Title
Which Problems Have Strongly Exponential Complexity?
DOI
doi.org/10.1006/jcss.2001.1774
Published Date
Dec 1, 2001
Journal
Journal of Computer and System Sciences
Volume
63
Issue
4
Pages
512 - 530
Notes
History
View all history