Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 221,780,359 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
2007
Highly Cited
2007
Human Activity Recognition Based on R Transform
Ying Wang
,
Kaiqi Huang
,
T. Tan
IEEE Conference on Computer Vision and Pattern…
2007
Corpus ID: 12733197
This paper addresses human activity recognition based on a new feature descriptor. For a binary human silhouette, an extended…
Expand
Highly Cited
2006
Highly Cited
2006
Utilization of a unitary transform for efficient computation in the matrix pencil method to find the direction of arrival
N. Yilmazer
,
Jinhwan Koh
,
Tapan K. Sarkar
IEEE Transactions on Antennas and Propagation
2006
Corpus ID: 23478254
In this study, we use the matrix pencil (MP) method to compute the direction of arrival (DOA) of the signals using a very…
Expand
Highly Cited
2004
Highly Cited
2004
How to Disembed a Program?
Benoît Chevallier-Mames
,
D. Naccache
,
Pascal Paillier
,
D. Pointcheval
IACR Cryptology ePrint Archive
2004
Corpus ID: 8844855
This paper presents the theoretical blueprint of a new secure token called the Externalized Microprocessor (X μ P). Unlike a…
Expand
Highly Cited
2003
Highly Cited
2003
The collaborative filtering recommendation based on SOM cluster-indexing CBR
T. Roh
,
K. Oh
,
Ingoo Han
Expert systems with applications
2003
Corpus ID: 8992038
Highly Cited
2001
Highly Cited
2001
A framework for efficient progressive fine granularity scalable video coding
Feng Wu
,
Shipeng Li
,
Ya-Qin Zhang
IEEE Trans. Circuits Syst. Video Technol.
2001
Corpus ID: 2044596
A basic framework for efficient scalable video coding, namely progressive fine granularity scalable (PFGS) video coding is…
Expand
Highly Cited
2001
Highly Cited
2001
A unified rate-distortion analysis framework for transform coding
Zhihai He
,
S. Mitra
IEEE Trans. Circuits Syst. Video Technol.
2001
Corpus ID: 16824537
In our previous work, we have developed a rate-distortion (R-D) modeling framework for H.263 video coding by introducing the new…
Expand
Highly Cited
1998
Highly Cited
1998
Hidden Markov models for face recognition
A. Nefian
,
M. Hayes
Proceedings of the IEEE International Conference…
1998
Corpus ID: 7040774
The work presented in this paper focuses on the use of hidden Markov models for face recognition. A new method based on the…
Expand
Review
1996
Review
1996
The genetic search approach. A new learning algorithm for adaptive IIR filtering
S. C. Ng
,
S. Leung
,
C. Chung
,
A. Luk
,
W. Lau
IEEE Signal Processing Magazine
1996
Corpus ID: 62363156
An "evolutionary" approach called the genetic algorithm (GA) was introduced for multimodal optimization in adaptive IIR filtering…
Expand
Highly Cited
1982
Highly Cited
1982
The Complexity of Fault Detection Problems for Combinational Logic Circuits
H. Fujiwara
,
S. Toida
IEEE transactions on computers
1982
Corpus ID: 206622544
In this correspondence we analyze the computational complexity of fault detection problems for combinational circuits and propose…
Expand
Highly Cited
1976
Highly Cited
1976
Optimal allocation of resources in distributed information networks
S. Mahmoud
,
J. Riordon
TODS
1976
Corpus ID: 1756309
The problems of file allocation and capacity assignment in a fixed topology distributed computer network are examined. These two…
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