
No constraints
( k=1)

k constraints


Contemporaneous
  
sampling

O(n)

O(n^{k})

(m=1)
  
Serial sampling
  
with no sampled

O(m n)

O(m^{2}n^{k})

ancestors
  
Serial sampling
  
with sampled

O(m n^{2})

‐

ancestors
  
 The table summaries the complexity of the counting algorithms, wheren is the sample size, k is the number of constraints, and m is the number of sampling time‐points. We assume that k is fixed.