Finite native separator-call adapter for a polynomial RAM function
ProvedLax263307Proofs.NativeSelectedNear.exists_programalgorithmscomputational-complexitylinear-programming
Let be a function from finite natural-number word lists to such lists, computed by one polynomial-time word-RAM program. Then there is one native separator-call program record for :
The record contains fixed finite code, polynomial width, time and output bounds, and an explicit encoding of the width polynomial. On each graph and rational-load input meeting its height and workspace guards, the actual call preserves the separator context and writes exactly the remaining mask, separator mask, cut count, cut records and piece records decoded from 's result. Its time is the record's explicit call bound. This adapter lets the selected polynomial flow routine participate in the native recursive algorithm.
Preamble
import Definitions.Def_EdgeSublinearMWIS_Main_NativeCertificateInterfaces
Formal statement
theorem Lax263307Proofs.NativeSelectedNear.exists_program : ∀ (f : List ℕ → List ℕ), Lax759944.RamPolytime.RamPolytime f → Nonempty (Lax263307Proofs.NativeSelectedNear.Program f) := by sorry
Source