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
2016
Highly Cited
2016
Software-Defined Device-to-Device (D2D) Communications in Virtual Wireless Networks With Imperfect Network State Information (NSI)
Software-defined networking (SDN) and network function virtualization (NFV) are a promising system architecture and control… 
Highly Cited
2007
Highly Cited
2007
A Fast Mode Decision Algorithm and Its VLSI Design for H.264/AVC Intra-Prediction
In this paper, we present a fast mode decision algorithm and design its VLSI architecture for H.264 intra-prediction. A regular… 
Highly Cited
2007
Highly Cited
2007
Generalized Comb Decimation Filters for $\Sigma\Delta$ A/D Converters: Analysis and Design
This paper addresses the design of generalized comb decimation filters, proposing some novel decimation schemes tailored to… 
Highly Cited
2002
Highly Cited
2002
Using learning automata for adaptive push-based data broadcasting in asymmetric wireless environments
Push systems are not suitable for applications with a priori unknown, dynamic client demands. This paper proposes an adaptive… 
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
1992
Highly Cited
1992
Fractal approximation of image blocks
A method for block coding of images based on a least squares fractal approximation by a self-affine system (SAS) is presented… 
Highly Cited
1991
Highly Cited
1991
16 kbps wideband speech coding technique based on algebraic CELP
The application of algebraic code excited linear prediction (ACELP) coding to wideband speech is presented. An algebraic codebook… 
Highly Cited
1990
Highly Cited
1990
Fast methods for the CELP speech coding algorithm
Special fast procedures for the code excited linear predictive coding (CELP) algorithm have been developed to make implementation… 
Highly Cited
1976
Highly Cited
1976
Optimal allocation of resources in distributed information networks
The problems of file allocation and capacity assignment in a fixed topology distributed computer network are examined. These two… 
Highly Cited
1976
Highly Cited
1976
Interconnections Between Processors and Memory Modules Using the Shuffle-Exchange Network
The shuffle-exchange network is considered as an interconnection network between processors and memory modules in an array… 
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)