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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2015

Cloud computing (CC) capacities deliver high quality, connected with demand services and service-oriented construction…

2014

Based on the extensive Kuramoto model, synchronization-inspired partitioning clustering algorithm was recently proposed and is…

2008

We study the problem of partitioning a spherical representation S of a free-form surface F in 3-D, which is to partition a 3-D…

2007

2006

In this paper, we investigate the problem of increasing the threshold parameter of the Shamir (t,n)-threshold scheme without…

2006

The self-shrinking generator was introduced in 1994. It is based on the idea behind the shrinking generator and despite its…

2004

Improving communication performance is an important issue in cluster systems. This paper investigates the possibility of…

1999

The population ecology of sandy beaches has been largely ignored in comparison to rocky shores, even though sandy beach fauna may…

1994

Motion of objects in contact plays an important role in the mechanical assembly by manipulators. This paper presents a motion…

Highly Cited

1984

Highly Cited

1984