中文
相关论文

相关论文: Revisiting the Complexity of Finding Globally Mini…

200 篇论文

The goal of nuclear structure theory is to build a comprehensive microscopic framework in which properties of nuclei and extended nuclear matter, and nuclear reactions and decays can all be consistently described. Due to novel theoretical…

核理论 · 物理学 2016-03-10 Witold Nazarewicz

This extended abstract presents an overview on NP-hard optimization problems with multiple interdependent components. These problems occur in many real-world applications: industrial applications, engineering, and logistics. The fact that…

人工智能 · 计算机科学 2016-06-23 Mohamed El Yafrani , Belaïd Ahiod

It has recently been shown that the problem of testing global convexity of polynomials of degree four is {strongly} NP-hard, answering an open question of N.Z. Shor. This result is minimal in the degree of the polynomial when global…

最优化与控制 · 数学 2019-03-14 Amir Ali Ahmadi , Georgina Hall

Improving the explainability of the results from machine learning methods has become an important research goal. Here, we study the problem of making clusters more interpretable by extending a recent approach of [Davidson et al., NeurIPS…

数据结构与算法 · 计算机科学 2020-02-10 Prathyush Sambaturu , Aparna Gupta , Ian Davidson , S. S. Ravi , Anil Vullikanti , Andrew Warren

Nuclear clustering describes the appearance of structures resembling smaller nuclei such as alpha particles (4He nuclei) within the interior of a larger nucleus. While clustering is important for several well-known examples, much remains to…

In this note we investigate the complexity of the Minimum Label Alignment problem and we show that such a problem is APX-hard.

计算复杂性 · 计算机科学 2012-06-12 Riccardo Dondi , Nadia El-Mabrouk

The purpose of this paper is to explore the applications of quantum computing to energy systems optimization problems and discuss some of the challenges faced by quantum computers with techniques to overcome them. The basic concepts…

量子物理 · 物理学 2020-03-03 Akshay Ajagekar , Fengqi You

We give an overview of results and prospects of nuclear clustering studies on the grounds of the observations of interactions of light stable and radioactive nuclei with an initial energy above 1 A GeV in nuclear emulsions. Thank to the…

Discrete energy minimization is widely-used in computer vision and machine learning for problems such as MAP inference in graphical models. The problem, in general, is notoriously intractable, and finding the global optimal solution is…

计算机视觉与模式识别 · 计算机科学 2016-08-01 Mengtian Li , Alexander Shekhovtsov , Daniel Huber

We have attempted to find the global minima of clusters containing between 20 and 80 atoms bound by the Morse potential as a function of the range of the interatomic force. The effect of decreasing the range is to destabilize strained…

凝聚态物理 · 物理学 2008-02-03 Jonathan Doye , David Wales

Modeling potential alloys requires the exploration of all possible configurations of atoms. Additionally, modeling the thermal properties of materials requires knowledge of the possible ways of displacing the atoms. One solution to finding…

材料科学 · 物理学 2017-01-11 Wiley S. Morgan , Gus L. W. Hart , Rodney W. Forcade

This note establishes, first of all, the monotonic increase with $N$ of the average $K$-body energy of classical $N$-body ground state configurations with $N\geq K$ monomers that interact solely through a permutation-symmetric $K$-body…

原子与分子团簇 · 物理学 2024-09-04 Michael K. -H. Kiessling , David J. Wales

Finding ground states of quantum many-body systems is known to be hard for both classical and quantum computers. As a result, when Nature cools a quantum system in a low-temperature thermal bath, the ground state cannot always be found…

量子物理 · 物理学 2023-09-29 Chi-Fang Chen , Hsin-Yuan Huang , John Preskill , Leo Zhou

Our work is motivated by the challenges presented in preparing arrays of atoms for use in quantum simulation. The recently-developed process of loading atoms into traps results in approximately half of the traps being filled. To consolidate…

计算复杂性 · 计算机科学 2025-04-09 Alexandre Cooper , Stephanie Maaz , Amer E. Mouawad , Naomi Nishimura

Graph clustering is the problem of identifying sparsely connected dense subgraphs (clusters) in a given graph. Proposed clustering algorithms usually optimize various fitness functions that measure the quality of a cluster within the graph.…

计算复杂性 · 计算机科学 2007-05-23 Jiri Sima , Satu Elisa Schaeffer

We theoretically investigate the possibility for a tetraneutron to exist as a low-energy resonance state. We explore a microscopic model based on the assumption that the tetraneutron can be treated as a compound system where $^3$n+n and…

核理论 · 物理学 2008-11-26 Yuliya Lashko , Gennady Filippov

We summarize the recent results of our survey of the nearest nuclear star clusters. The purpose of the survey is to understand nuclear star cluster formation mechanisms and constrain the presence of black holes using adaptive optics…

We study set selection problems where the weights are uncertain. Instead of its exact weight, only an uncertainty interval containing its true weight is available for each element. In some cases, some solutions are universally optimal;…

数据结构与算法 · 计算机科学 2024-04-29 Christoph Dürr , Arturo Merino , José A. Soto , José Verschae

Finding Minimum Energy Configurations (MECs) is essential in fields such as physics, chemistry, and materials science, as they represent the most stable states of the systems. In particular, identifying such MECs in multi-component alloys…

材料科学 · 物理学 2025-01-27 Md Rajib Khan Musa , Yichen Qian , Jie Peng , David Cereceda

We present a new theoretical framework for modelling the cluster growing process. Starting from the initial tetrahedral cluster configuration, adding new atoms to the system and absorbing its energy at each step, we find cluster growing…

原子与分子团簇 · 物理学 2007-05-23 A. Koshelev , A. Shutovich , Il. A. Solov'yov , A. V. Solov'yov , W. Greiner