Simplicity and Complexity in Combinatorial Optimization
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) op...
Wedi'i Gadw mewn:
| Prif Awduron: | , |
|---|---|
| Fformat: | Artigo |
| Iaith: | Inglês |
| Cyhoeddwyd: |
MDPI AG
2026-02-01
|
| Cyfres: | Entropy |
| Pynciau: | |
| Mynediad Ar-lein: | https://www.mdpi.com/1099-4300/28/2/226 |
| Tagiau: |
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!
|