Entropy · 15 Feb 2026
Simplicity and Complexity in Combinatorial Optimization
Kamal Dingleh-index 11, Marcus Hutterh-index 43
Citations by database
Each database indexes a different set of journals, preprints and books, so they are shown side by side rather than blended.
- Crossref2
- OpenAlex1
- OpenCitations0
Citations per year
The current year is still counting.
- 2026 so far0
Abstract
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.
What the data shows
- Crossref counts 2 citations, the most of the databases. The others count 0 to 1.
- Marcus Hutter has the highest h-index among the authors (43).
Graph
This paper in the middle, its authors and their most-cited papers below, the papers it cites to the left and the papers citing it to the right. The timeline lays every paper out by year.
Select a node for its details. Drag to pan, scroll to zoom, drag a node to move it.
Start with
Cited by 0 papers
Who cites this paper, from open citation data, with Crossref's record of each; the 100 newest when there are more.
References (49)
What it cites, from open citation data, with Crossref's record of each.
Sign in to see 29 more references
A free account opens the rest of the citing papers and references on every paper’s page.