Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,058,236 papers from all fields of science
Search
Sign In
Create Free Account
Computational complexity theory
Known as:
Computationally efficient
, Intractableness
, Computational intractablity
Expand
Computational complexity theory is a branch of the theory of computation in theoretical computer science that focuses on classifying computational…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
ACM Turing Award
AKS primality test
Adjacency list
Aho–Corasick algorithm
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
The Polarizing Impact of Science Literacy and Numeracy on Perceived Climate Change Risks
D. Kahan
,
E. Peters
,
+4 authors
Gregory N. Mandel
2012
Corpus ID: 53631207
Seeming public apathy over climate change is often attributed to a deficit in comprehension. The public knows too little science…
Expand
Highly Cited
2007
Highly Cited
2007
Computational complexity of interacting electrons and fundamental limitations of density functional theory
N. Schuch
,
F. Verstraete
2007
Corpus ID: 67775117
Using arguments from computational complexity theory, fundamental limitations are found for how efficient it is to calculate the…
Expand
Highly Cited
2006
Highly Cited
2006
Computational complexity of stochastic programming problems
M. Dyer
,
L. Stougie
Mathematical programming
2006
Corpus ID: 7764986
Stochastic programming is the subfield of mathematical programming that considers optimization in the presence of uncertainty…
Expand
Highly Cited
1996
Highly Cited
1996
Quantum Computation and Shor's Factoring Algorithm
A. Ekert
,
R. Jozsa
1996
Corpus ID: 16903837
Current technology is beginning to allow us to manipulate rather than just observe individual quantum phenomena. This opens up…
Expand
Highly Cited
1989
Highly Cited
1989
On a theory of computation and complexity over the real numbers; np-completeness
L. Blum
,
M. Shub
,
S. Smale
1989
Corpus ID: 7758571
. We present a model for computation over the reals or an arbitrary (ordered) ring R. In this general setting, we obtain…
Expand
Highly Cited
1987
Highly Cited
1987
Some Considerations about Computational Complexity for Multi Objective Combinatorial Problems
P. Serafini
1987
Corpus ID: 62634106
In the field of vector (or multi objective) optimization there has been a relatively little interest in solving combinatorial or…
Expand
Highly Cited
1986
Highly Cited
1986
Computational complexity of art gallery problems
D. T. Lee
,
A. K. Lin
IEEE Transactions on Information Theory
1986
Corpus ID: 27478799
We study the computational complexity of the art gallery problem originally posed by Klee, and its variations. Specifically, the…
Expand
Highly Cited
1978
Highly Cited
1978
Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
N. Megiddo
Mathematics of Operations Research
1978
Corpus ID: 13254082
In the game theory approach to the problem of allocating cost, the users of a facility are viewed as players in a cooperative n…
Expand
Highly Cited
1974
Highly Cited
1974
Computational complexity of probabilistic Turing machines
John Gill
Symposium on the Theory of Computing
1974
Corpus ID: 15320656
Probabilistic Turing machines are Turing machines with the ability to flip coins in order to make random decisions. We allow…
Expand
Highly Cited
1965
Highly Cited
1965
On the Computational Complexity of Algorithms
J. Hartmanis
,
R. Stearns
1965
Corpus ID: 40185800
Computational complexity theory the study of the.A common way to evaluate the time complexity of an algorithm is to use…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE