![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Journal of Complexity, Volume 75
Volume 75, April 2023
- Mordechay B. Levin:
Central Limit Theorem for (t,s)-sequences in base 2. 101699 - Zexin Pan, Art B. Owen:
The nonzero gain coefficients of Sobol's sequences are always powers of two. 101700 - Joos Heintz, Luis Miguel Pardo, Enrique Carlos Segura, Hvara Ocar, Andres Rojas Paredes:
An unfeasibility view of neural network learning. 101710 - Gaurav Mittal, Ankik Kumar Giri:
Convergence analysis of an optimally accurate frozen multi-level projected steepest descent iteration for solving inverse problems. 101711 - Nardo Giménez, Guillermo Matera, Mariana Pérez
, Melina Privitelli:
On the computation of rational solutions of underdetermined systems over a finite field. 101712 - Stefan Steinerberger
:
An elementary proof of a lower bound for the inverse of the star discrepancy. 101713 - Erich Novak:
Journal of Complexity Best Paper Award. 101723 - Josef Dick, Aicke Hinrichs, Erich Novak, Klaus Ritter, Grzegorz W. Wasilkowski, Henryk Wozniakowski:
Changes of the Editorial Board. 101728 - Alexey A. Khartov, David Krieg, Erich Novak, Michaela Szölgyenyi, Henryk Wozniakowski:
Information-based complexity young researcher award. 101729 - Erich Novak:
Nominations for 2023 Joseph F. Traub Information-Based Complexity Young Researcher Award. 101730 - Erich Novak:
Best Paper Award of the Journal of Complexity. 101731
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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.