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)

Related topics

Related topics

50 relations
ACM Turing AwardAKS primality testAdjacency listAho–Corasick algorithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
Speech Data Compression using Vector Quantization
(cid:3) Abstract— Mostly transforms are used for speech data compressions which are lossy algorithms. Such algorithms are… 
Highly Cited
2004
Highly Cited
2004
A specific heat ratio model and compression ratio estimation
Cylinder pressure modeling and heat release analysis are today important and standard tools for engineers and researchers, when… 
Highly Cited
2001
Highly Cited
2001
Shadow detection algorithms for traffic flow analysis: a comparative study
Shadow detection is critical for robust and reliable vision-based systems for traffic flow analysis. In this paper we discuss… 
Highly Cited
1998
Highly Cited
1998
An efficient mel-LPC analysis method for speech recognition
This paper proposes a simple and e(cid:14)cient time domain technique to estimate an all-poll model on a mel-frequency axis (Mel… 
Highly Cited
1997
Highly Cited
1997
Trellis-coded cochannel interference canceller for microcellular radio
Cochannel interference is a major impairment that limits the capacity of microcellular radio systems. This paper proposes a… 
Highly Cited
1995
Highly Cited
1995
Redesign of hybrid adaptive/robust motion control of rigid-link electrically-driven robot manipulators
In a recent work of the authors (1995), a hybrid adaptive controller for rigid-link electrically-driven robot manipulators was… 
Highly Cited
1990
Highly Cited
1990
Efficient search procedures for selecting the optimum innovation in stochastic coders
The authors describe several procedures that simplify the search in stochastic coders, but do not put constraints on the… 
Highly Cited
1988
Highly Cited
1988
Construction of the Octree Approximating a Three-Dimensional Object by Using Multiple Views
A fast, efficient, algorithm that processes polyhedral cones from views of an object to produce an octree representation of the… 
Highly Cited
1987
Highly Cited
1987
Real-time vector excitation coding of speech at 4800 bps
In Vector Excitation Coding (VXC), speech is represented by applying a sequence of excitation vectors to a time-varying speech… 
Highly Cited
1977
Highly Cited
1977
Symbolic analysis of analog and digital circuits
An efficient computer method for symbolic analysis of linear analog and digital circuits is described. The tableau formulation is… 
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)