default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Complexity, Volume 49
Volume 49, December 2018
- Stefan Heinrich:
On the complexity of computing the Lq norm. 1-26 - Jia Chen, Heping Wang, Jie Zhang:
Average case (s, t)-weak tractability of non-homogeneous tensor product problems. 27-45 - Domingo Gómez-Pérez
, Min Sha, Andrew Z. Tirkel:
On the linear complexity for multidimensional sequences. 46-55 - Janak Raj Sharma, Deepak Kumar:
A fast and efficient composite Newton-Chebyshev method for systems of nonlinear equations. 56-73 - Marek Karpinski, László Mérai, Igor E. Shparlinski:
Identity testing and interpolation from high powers of polynomials of large degree over finite fields. 74-84 - Hongzhi Tong, Michael Ng:
Analysis of regularized least squares for functional linear regression model. 85-94
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-09-30 20:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
