Skip to search formSkip to main contentSkip to account menu

Computational complexity theory

Known as: Computationally efficient, Intractableness, Computational intractablity 
Computational complexity theory is a branch of the theory of computation in theoretical computer science that focuses on classifying computational… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
This paper addresses human activity recognition based on a new feature descriptor. For a binary human silhouette, an extended… 
Highly Cited
2006
Highly Cited
2006
In this study, we use the matrix pencil (MP) method to compute the direction of arrival (DOA) of the signals using a very… 
Highly Cited
2004
Highly Cited
2004
This paper presents the theoretical blueprint of a new secure token called the Externalized Microprocessor (X μ P). Unlike a… 
Highly Cited
2001
Highly Cited
2001
A basic framework for efficient scalable video coding, namely progressive fine granularity scalable (PFGS) video coding is… 
Highly Cited
2001
Highly Cited
2001
In our previous work, we have developed a rate-distortion (R-D) modeling framework for H.263 video coding by introducing the new… 
Highly Cited
1998
Highly Cited
1998
  • A. NefianM. Hayes
  • 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… 
Review
1996
Review
1996
An "evolutionary" approach called the genetic algorithm (GA) was introduced for multimodal optimization in adaptive IIR filtering… 
Highly Cited
1982
Highly Cited
1982
In this correspondence we analyze the computational complexity of fault detection problems for combinational circuits and propose… 
Highly Cited
1976
Highly Cited
1976
The problems of file allocation and capacity assignment in a fixed topology distributed computer network are examined. These two…