Skip to search formSkip to main contentSkip to account menu

Asymptotic computational complexity

Known as: Asymptotic space complexity, Asymptotic time complexity 
In computational complexity theory, asymptotic computational complexity is the usage of asymptotic analysis for the estimation of computational… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
In this paper, we consider a computation offloading problem in a fog-enabled Internet of Things (IoT) network consisting of… 
2015
2015
Cloud computing (CC) capacities deliver high quality, connected with demand services and service-oriented construction… 
2010
2010
This thesis uses asymptotic and numerical techniques to examine high Reynolds flow past an array of many blades in various… 
2007
2007
Boolean function f on n variables is represented by set I of disjoint intervals of non-negative n-bit integers, if the following… 
2007
2007
Computational science (CS) is often referred to as the third science, complementing both theoretical and laboratory science. In… 
2000
2000
We compare the asymptotic time complexity of left-to-right and bidirectional parsing techniques for bilexical context-free… 
1999
1999
The population ecology of sandy beaches has been largely ignored in comparison to rocky shores, even though sandy beach fauna may… 
1994
1994
Motion of objects in contact plays an important role in the mechanical assembly by manipulators. This paper presents a motion… 
1990
1990
  • M. MisraV. Prasanna
  • 1990
  • Corpus ID: 61690127
A single-input multiple-data architecture which has n processing elements and n/sup 2/ memory modules arranged in an n*n array is…