Raw finite-query preorders collapse the CH23 spectral block to a single source while modal preorders under geometric admissibility yield exactly two minimal exact sources, reformulating the SCI exact-basis problem.
Computing spectra--on the solvability complexity index hierarchy and towers of algorithms
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
verdicts
UNVERDICTED 3representative citing papers
Formalizes a trichotomy of exactness notions for SCI on families, proves witness-space sharpness equals worst-case exactness but is strictly weaker than family-pointwise exactness, supplies upgrade theorems, and illustrates with integration and spectral families.
Proves SCI upper bounds for regularized and closed approximate point ε-pseudospectra plus the approximate point spectrum of Koopman operators in L^p (1<p<∞) for four classes of maps via dictionaries and tagged quadrature residuals.
citing papers explorer
-
Finite-Query Collapse and Modal Exact Bases in the SCI Hierarchy
Raw finite-query preorders collapse the CH23 spectral block to a single source while modal preorders under geometric admissibility yield exactly two minimal exact sources, reformulating the SCI exact-basis problem.
-
From Witness-Space Sharpness To Family-Pointwise Exactness For The Solvability Complexity Index
Formalizes a trichotomy of exactness notions for SCI on families, proves witness-space sharpness equals worst-case exactness but is strictly weaker than family-pointwise exactness, supplies upgrade theorems, and illustrates with integration and spectral families.
-
Residual SCI Upper Bounds And Lower Witnesses For Koopman Approximate Point Spectra In $L^p$ For $1<p<\infty$: Extended Version
Proves SCI upper bounds for regularized and closed approximate point ε-pseudospectra plus the approximate point spectrum of Koopman operators in L^p (1<p<∞) for four classes of maps via dictionaries and tagged quadrature residuals.