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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
We present a framework in Isabelle for verifying asymptotic time complexity of imperative programs. We build upon an extension of… (More)
Is this relevant?
2016
2016
Lattice-based cryptography has recently emerged as a prime candidate for efficient and secure post-quantum cryptography. The two… (More)
  • figure 1
  • figure 2
Is this relevant?
2013
2013
We construct an endogenous growth model of directed technical change with automation (the introduction of machines which replace… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
2012
2012
We describe an approach to the numerical solution of the integral equations of scattering theory on planar curves with corners… (More)
  • table 1
  • figure 1
  • figure 2
  • table 2
  • figure 3
Is this relevant?
2010
2010
We consider the separation of Gaussian sources exhibiting general, arbitrary (not necessarily stationary) covariance structures… (More)
  • figure 1
  • figure 2
  • table I
  • figure 3
  • table II
Is this relevant?
2006
2006
We investigate the properties of the Benjamini–Hochberg method for multiple testing and of a variant of Storey’s generalization… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2005
2005
We provide a very general result that identifies the essential spectrum of broad classes of operators as exactly equal to the… (More)
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Macroecology is a rapidly growing branch of ecology. The essence of macroecology can be summarized as a two-step process: 1) find… (More)
  • table 2
  • table 1
  • table 3
  • figure 1
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Stanton (1997) and Aït-Sahalia (1996) use nonparametric estimators applied to short term interest rate data to conclude that the… (More)
  • table I
  • table II
  • table III
  • table IV
  • table V
Is this relevant?
Highly Cited
1996
Highly Cited
1996
We present an improvement to Harvey and Ginsberg’s limited discrepancy search algorithm, which eliminates much of the redundancy… (More)
  • figure 1
  • figure 4
  • figure 5
  • figure 6
  • figure 7
Is this relevant?