Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 241,175,285 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.
Review
2010
Review
2010
Survey of Visual Cryptography Schemes
P. S. Revenkar
,
A. Anjum
,
W. Gandhare
2010
Corpus ID: 17440309
Visual cryptography scheme is a cryptographic technique which allows visual information (e.g. printed text, handwritten notes…
Expand
2008
2008
Interference Avoidance and Control
R. Gummadi
,
R. Patra
,
H. Balakrishnan
,
E. Brewer
ACM Workshop on Hot Topics in Networks
2008
Corpus ID: 2827231
The throughput of a wireless network is often limited by interference caused by multiple concurrently active nodes . The…
Expand
Highly Cited
2004
Highly Cited
2004
A specific heat ratio model and compression ratio estimation
M. Klein
2004
Corpus ID: 93005001
Cylinder pressure modeling and heat release analysis are today important and standard tools for engineers and researchers, when…
Expand
Highly Cited
2003
Highly Cited
2003
Minimization of the Makespan with a Discrete-Time State−Task Network Formulation
C. Maravelias
,
I. Grossmann
2003
Corpus ID: 16866928
A novel algorithm is proposed for the minimization of the makespan of multipurpose batch plants using the state−task network (STN…
Expand
Highly Cited
1999
Highly Cited
1999
Dithered signed-error CMA: robust, computationally efficient blind adaptive equalization
Philip Schniter
,
C. Johnson
IEEE Transactions on Signal Processing
1999
Corpus ID: 527741
Adaptive blind equalization has gained widespread use in communication systems that operate without training signals. In…
Expand
1997
1997
Simplified per-survivor Kalman processing in fast frequency-selective fading channels
M. Rollins
,
S. Simmons
IEEE Transactions on Communications
1997
Corpus ID: 27822372
Per-survivor processing (PSP) is now seen as an attractive approach to performing maximum-likelihood sequence estimation (MLSE…
Expand
1993
1993
Plan Modification versus Plan Generation: A Complexity-Theoretic Perspective
Bernhard Nebel
,
Jana Koehler
International Joint Conference on Artificial…
1993
Corpus ID: 15442316
The ability of a planner to modify a plan is considered as a valuable tool for improving ee-ciency of planning by avoiding the…
Expand
Highly Cited
1990
Highly Cited
1990
Fast methods for the CELP speech coding algorithm
W. Kleijn
,
D. Krasinski
,
R. H. Ketchum
IEEE Transactions on Acoustics Speech and Signal…
1990
Corpus ID: 3142985
Special fast procedures for the code excited linear predictive coding (CELP) algorithm have been developed to make implementation…
Expand
Highly Cited
1990
Highly Cited
1990
Efficient search procedures for selecting the optimum innovation in stochastic coders
Isabel Trancoso
,
B. Atal
IEEE Transactions on Acoustics Speech and Signal…
1990
Corpus ID: 35135824
The authors describe several procedures that simplify the search in stochastic coders, but do not put constraints on the…
Expand
Review
1970
Review
1970
Techniques for Optimum Spares Allocation: A Tutorial Review
M. Messinger
,
M. Shooman
1970
Corpus ID: 60835108
In many modern complex systems the problem of achieving high reliability leads to the use of interchangeable modular components…
Expand