3 citations · 4 across the 13 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
cs.LG2026
What Must Survive? Exact Task-Information--State Frontiers Under Partial Task Revelation
Ronald Katende
A state may need to be compressed before its exact downstream task is known. For a finite family of linear task operators $\{T_u\}_{u\in\U}$, we characterize exactly how much state…
cs.CC2026
Contextual Fraction Beyond Satisfiability: Pure NAE Completeness, Exact Orbit Packings, and Width Barriers
Ronald Katende
The contextual fraction measures how much globally consistent probability can be packed beneath prescribed local event probabilities. We study the quantitative regime in which supp…
cs.DS2026
Contextual Fraction on Permutation Gain Graphs: Exact Algorithms, Query Lower Bounds, and Dynamic Maintenance
Ronald Katende
For an explicitly represented finite empirical model, deciding whether the contextual fraction is strictly below one is NP-complete, while the standard exact linear program has one…