Results 61 to 70 of about 1,098,765 (109)
On the Computational Complexity of Problems Related to Distinguishability Sets
Workshop on Descriptional Complexity of Formal Systems, 2015 M. Holzer, Sebastian Jakobi
semanticscholar +1 more source
Special issue “Conference on Computational Complexity 2014” Guest Editor’s Foreword
Computational Complexity, 2015 M. Saks
semanticscholar +1 more source
Special Issue “Conference on Computational Complexity 2013” Guest editor’s foreword
Computational Complexity, 2014 C. Umans
semanticscholar +1 more source
On the computational complexity of membership problems for the completely positive cone and its dual
Computational optimization and applications, 2013 Peter J. C. Dickinson, Luuk Gijben
semanticscholar +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
WIREs Computational Molecular Science, 2021
In the past decade, developments of computational technology around density functional theory (DFT) calculations have considerably increased the system sizes which can be practically simulated.
William Dawson +5 more
semanticscholar +1 more source
In the past decade, developments of computational technology around density functional theory (DFT) calculations have considerably increased the system sizes which can be practically simulated.
William Dawson +5 more
semanticscholar +1 more source
The Parameterized Complexity of Coordinated Motion Planning
International Symposium on Computational Geometry, 2023In Coordinated Motion Planning (CMP), we are given a rectangular-grid on which $k$ robots occupy $k$ distinct starting gridpoints and need to reach $k$ distinct destination gridpoints.
E. Eiben, R. Ganian, Iyad A. Kanj
semanticscholar +1 more source
IEEE Region International Conference on Computational Technologies in Electrical and Electronics Engineering, 2019
Usually, when speaking about dependence estimation in big sets of empirical data, it is adopted to suggest that the set of precedents does not fit in the memory of one computer, and some technology of distributed computing is required.
V. Mottl +5 more
semanticscholar +1 more source
Usually, when speaking about dependence estimation in big sets of empirical data, it is adopted to suggest that the set of precedents does not fit in the memory of one computer, and some technology of distributed computing is required.
V. Mottl +5 more
semanticscholar +1 more source
Computational Complexity of the Interleaving Distance
International Symposium on Computational Geometry, 2017The interleaving distance is arguably the most prominent distance measure in topological data analysis. In this paper, we provide bounds on the computational complexity of determining the interleaving distance in several settings.
Håvard Bakke Bjerkevik, M. B. Botnan
semanticscholar +1 more source
Computational optimization and applications, 2017
In this paper, we propose a new optimization algorithm for sparse logistic regression based on a stochastic version of the Douglas–Rachford splitting method. Our algorithm performs both function and variable splittings.
L. Briceño-Arias +3 more
semanticscholar +1 more source
In this paper, we propose a new optimization algorithm for sparse logistic regression based on a stochastic version of the Douglas–Rachford splitting method. Our algorithm performs both function and variable splittings.
L. Briceño-Arias +3 more
semanticscholar +1 more source