Skip to content
  1. CLRS-Lean
  2. Chapter 34. NP-Completeness
  3. 34.4. NP-Completeness Proofs
  4. 34.4. Verified bounded TM2 builders
  5. 34.4. Fixed selection of delimited binary fields
Browse chapters
Imports
import CLRSLean.Chapter_34.Section_34_4_NP_Completeness_Proofs.PolyBuilder.SelectDelimitedFields.Runtime

Fixed selection of delimited binary fields

This facade exposes the total semantic selector, its exact builder execution, and the compiled fixed-machine polynomial-time theorem.