Proves Ω(k²) adversarial lower bound for non-coprime CRT sparse FFT and introduces certified framework with bucket/candidate checks plus adaptive dense fallback to enforce O(N log N) worst-case complexity.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Resolution information equals a binary divergence based only on prior probabilities when posteriors are unconstrained, but constrained generative representations can induce irreducible ambiguity floors due to posterior geometry.
citing papers explorer
-
Safety-Certified CRT Sparse FFT: $\Omega(k^2)$ Lower Bound and $O(N \log N)$ Worst-Case
Proves Ω(k²) adversarial lower bound for non-coprime CRT sparse FFT and introduces certified framework with bucket/candidate checks plus adaptive dense fallback to enforce O(N log N) worst-case complexity.
-
Resolution Information: Limits of Ambiguity Resolution for Generative Communication
Resolution information equals a binary divergence based only on prior probabilities when posteriors are unconstrained, but constrained generative representations can induce irreducible ambiguity floors due to posterior geometry.