CompositeNDP                                                                   
│    provides   complexity_A   SB(≥0) │ requires   complexity   SB(≥0)         
│    provides   complexity_B   SB(≥0) │                                        
│  4 nodes, 3 edges                                                            
│   connected rec: ✓                                                           
│  provided complexity_A    ≤ complexity_A provided by _sum   equiv id         
│  provided complexity_B    ≤ complexity_B provided by _sum   equiv id         
│  _result required by _sum ≤ required complexity             equiv id         
└ SimpleWrap                                                                   
  │  provides   complexity_A   SB(≥0) │ requires   _result   SB(≥0)            
  │  provides   complexity_B   SB(≥0) │                                        
  └ M_Res_AddMany_DP WU ⟨dimensionless,dimensionless⟩  ⇸  SB(≥0)               
                     (SB(≥0)×SB(≥0))                                           
     𝒇₁ + 𝒇₂ ≤ 𝒓                                                               
    ├      Fs: ├ SB(≥0)                                                        
    │          └ SB(≥0)                                                        
    ├ opspace: SB(≥0)                                                          
    └    algo: ApproximationAlgorithms - ApproximationAlgorithms.VAN_DER_CORPUT