Uniform native algorithm data for a separator class
ProvedLax263307Proofs.NativeQptasImplementation.exists_fixedalgorithmscomputational-complexitygraph-theory
Let be a hereditary graph class with strongly edge-sublinear separators. There is one fixed native implementation package:
Its finite backend programs and positive resource constants are selected before the graph, weights, accuracy and host width. The package includes the semantic approximation and uniform root-budget bounds.
Preamble
import Definitions.Def_EdgeSublinearMWIS_Main_NativeSchemeInterfaces
Formal statement
theorem Lax263307Proofs.NativeQptasImplementation.exists_fixed : ∀ (C : Lax263307.GraphClasses.GraphClass),
Lax263307.GraphClasses.IsHereditary C →
Lax263307.EdgeSublinearSeparators.HasStronglyEdgeSublinearSeparators C →
Nonempty (Lax263307Proofs.NativeQptasImplementation.Fixed C) := by sorrySource