Tag: complexity theory
-
When Diversity Becomes Logic
How selecting diverse subsets can encode logical circuits Michael Emmerich, May 12th 2026. Figure 1 shows how the satisfiability of the 3-SAT clause (‘1’ OR ‘2’ OR ‘3’) can be encoded as a maximum-diversity subset selection problem. Each disc centre represents a candidate choice, and the task is to select as many non-overlapping discs as…
-
The Hardness of Proving Hardness: Selecting Minimum Riesz Energy Subsets on a Line
Figure: Logarithmically scaled Riesz interaction matrix for a random set of 30 points on the unit interval, with cell sizes proportional to the distances between points. Each rectangle corresponds to a pair of points: darker cells indicate stronger interactions (points that are closer on the line), while lighter cells indicate weaker interactions. Off-diagonal entries show…
Michael Emmerich 