Introduces soft Tuy-completeness with greedy (1-1/e approx) and MILP solvers for projection selection in cone-beam CT, reports 0.998 median greedy-to-MILP ratio on benchmarks, and defines ESR as a trajectory diagnostic for feature size.
ComplexityBlowupinSimulatingAnalogLinearTime- Invariant Systems on Digital Computers
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
extension 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
extension 1polarities
extend 1representative citing papers
Most linear ODEs exhibit complexity blowup in digital simulation unless they meet specific algebraic degeneracy conditions, extending prior first-order characterizations.
citing papers explorer
-
Soft Tuy-Completeness for Robust Projection Selection in Cone-Beam CT
Introduces soft Tuy-completeness with greedy (1-1/e approx) and MILP solvers for projection selection in cone-beam CT, reports 0.998 median greedy-to-MILP ratio on benchmarks, and defines ESR as a trajectory diagnostic for feature size.