Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Complexity, Volume 29
Volume 29, Number 1, February 2013
- Pawel Przybylowicz wins the 2012 Information-Based Complexity Young Researcher Award. 2
- Leslaw Gajek
, Wojciech Niemiro, Piotr Pokarowski:
Optimal Monte Carlo integration with fixed relative precision. 4-26 - Chao-Wen Huang, Chia-Wei Lee, Huang-Ming Gao, Sun-Yuan Hsieh:
The internal Steiner tree problem: Hardness and approximations. 27-43 - Chiou-Ting Tseng, Chang-Biau Yang, Hsing-Yen Ann:
Efficient algorithms for the longest common subsequence problem with sequential substring constraints. 44-52 - Magali Bardet, Jean-Charles Faugère, Bruno Salvy, Pierre-Jean Spaenlehauer:
On the complexity of solving quadratic Boolean systems. 53-75 - Markus Hegland, Grzegorz W. Wasilkowski:
On tractability of approximation in special function spaces. 76-91 - Joos Heintz, Bart Kuijpers, Andres Rojas Paredes:
Software Engineering and complexity in effective Algebraic Geometry. 92-138
- Grzegorz W. Wasilkowski:
Erratum to "Liberating the dimension for L2-approximation" [Journal of Complexity 28 (2012) 304-319]. 139
Volume 29, Number 2, April 2013
- Dmitriy Bilyk, Lutz Kämmerer, Stefan Kunis, Daniel Potts, Volodya Temlyakov and Rui Yu share the 2012 Best Paper Award. 141
- Bruno Grenet, Pascal Koiran, Natacha Portier:
On the complexity of the multivariate resultant. 142-157 - Luca Brandolini, Leonardo Colzani, Giacomo Gigante, Giancarlo Travaglini:
On the Koksma-Hlawka inequality. 158-172 - Zhen Ma, Wen-Feng Qi, Tian Tian:
On the decomposition of an NFSR into the cascade connection of an NFSR into an LFSR. 173-181 - Christoph Aistleitner:
On the inverse of the discrepancy for infinite dimensional infinite sequences. 182-194 - Haizhang Zhang, Jun Zhang:
Vector-valued reproducing kernel Banach spaces with applications to multi-task learning. 195-215 - Christine Choirat, Raffaello Seri:
Numerical properties of generalized discrepancies on spheres of arbitrary dimension. 216-235
Volume 29, Numbers 3-4, June - August 2013
- Shu Tezuka:
On the discrepancy of generalized Niederreiter sequences. 240-247 - Ker-I Ko:
On the complexity of computing the Hausdorff distance. 248-262 - Ezequiel Dratman:
Efficient approximation of the solution of certain nonlinear reaction-diffusion equations with small absorption. 263-282 - Yong-Dao Zhou, Kai-Tai Fang, Jian-Hui Ning:
Mixture discrepancy for quasi-random point sets. 283-301 - Bahman Kalantari:
Algorithms for quaternion polynomial root-finding. 302-322
Volume 29, Number 5, October 2013
- Mario Fernández, Luis M. Pardo:
An Arithmetic Poisson Formula for the multi-variate resultant. 323-350 - Grzegorz W. Wasilkowski:
On tractability of linear tensor product problems for ∞∞-variate classes of functions. 351-369 - Lev Markhasin:
Quasi-Monte Carlo methods for integration of functions with dominating mixed smoothness in arbitrary dimension. 370-388 - Shengli Zhao, Pengfei Li, Min-Qian Liu:
On blocked resolution IV designs containing clear two-factor interactions. 389-395
Volume 29, Number 6, December 2013
- Gerhard Larcher:
Probabilistic diophantine approximation and the distribution of Halton-Kronecker sequences. 397-423 - Dinh Dung, Charles A. Micchelli:
Multivariate approximation by translates of the Korobov function on Smolyak grids. 424-437 - Pawel Siedlecki:
Uniform weak tractability. 438-453 - Ioannis K. Argyros, Sanjay Kumar Khattri:
On the Secant method. 454-471
a service of 
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-04-25 20:50 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:
