![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Jakoby A. Reischuk R. Schindelhauer C.
Publisher: Academic Press
ISSN: 0890-5401
Source: Information and Computation, Vol.150, Iss.2, 1999-05, pp. : 187-208
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
On the average‐case complexity of Shellsort
RANDOM STRUCTURES AND ALGORITHMS, Vol. 52, Iss. 2, 2018-03 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
The Complexity of Tensor Circuit Evaluation
By Beaudry Martin Holzer Markus
computational complexity, Vol. 16, Iss. 1, 2007-05 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
On the Complexity of Learning from Drifting Distributions
Information and Computation, Vol. 138, Iss. 2, 1997-11 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)