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...

Full description

Saved in:
Bibliographic Details
Published in:Entropy (Basel, Switzerland) Switzerland), 2026-02, Vol.28 (2), p.226
Main Authors: Dingle, Kamal, Hutter, Marcus
Format: Article
Language:English
Subjects:
algorithmic information theory
algorithmic sufficient statistics
Codes
Combinatorial analysis
combinatorial optimization
Complexity
Computer science
Data compression
geometrical frustration
Geometry
Information theory
Kolmogorov complexity
Optimization
Physics
symmetry
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!