.png){kind=icon}
.png){kind=icon}
Return
Simplicity and Complexity in Combinatorial Optimization
.png){kind=icon}
OA
AI
DOI：10.3390/e28020226.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Many problems in physics and computer science can be framed in terms of combinatorial optimization. Due to this, it is interesting and important to study theoretical aspects of such optimization. Here, we study connections between Kolmogorov complexity, optima, and optimization. We argue that (1) optima and complexity are connected, with extrema being more likely to have low complexity (under certain circumstances); (2) optimization by sampling candidate solutions according to algorithmic probability may be an effective optimization method; and (3) coincidences in extrema to optimization problems are a priori more likely as compared to a purely random null model.
Keywords:
combinatorial optimization
Kolmogorov complexity
algorithmic information theory
algorithmic sufficient statistics
symmetry
geometrical frustration
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2
Papers:
919
Citations:
2.4W