Results 51 to 60 of about 279,119 (104)

Message passing in random satisfiability problems

, 2004
This talk surveys the recent development of message passing procedures for solving constraint satisfaction problems. The cavity method from statistical physics provides a generalization of the belief propagation strategy that is able to deal with the ...
Mezard, Marc
core   +1 more source

Computational Complexity and Property Testing: On the Interplay Between Randomness and Computation

Computational Complexity and Property Testing, 2020
Oded Goldreich, E. Bertino, A. Wigderson
semanticscholar   +1 more source

High-order time stepping for the Navier-Stokes equations with minimal computational complexity [PDF]

Journal of Computational and Applied Mathematics, 2016
J. Guermond, P. Minev
semanticscholar   +1 more source

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

Computational complexity and an integer programming model of Shakashaka

Canadian Conference on Computational Geometry, 2013
E. Demaine, Yoshio Okamoto, Ryuhei Uehara, Yushi Uno   +3 more
semanticscholar   +1 more source

Special Issue “Conference on Computational Complexity 2013” Guest editor’s foreword

Computational Complexity, 2014
C. Umans
semanticscholar   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Density functional theory calculations of large systems: Interplay between fragments, observables, and computational complexity

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, A. Degomme, M. Stella, T. Nakajima, L. Ratcliff, L. Genovese   +5 more
semanticscholar   +1 more source

Computational Complexity of the Interleaving Distance

International Symposium on Computational Geometry, 2017
The 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 complexity, algorithmic scope, and evolution

Journal of Physics: Complexity
Biological systems are widely regarded as performing computations. It is much less clear, however, what exactly is computed and how biological computation fits within the framework of standard computer science.
Leonhard Sidl, Maximilian Faissner, Manuel Uhlir, Cristian A. Velandia-Huerto, Maria Waldl, Hua-Ting Yao, I. Hofacker, Peter F. Stadler   +7 more
semanticscholar   +1 more source

The Parameterized Complexity of Coordinated Motion Planning

International Symposium on Computational Geometry, 2023
In 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