“…2.1, while adopting the 'Warp-Speed' Monte Carlo method of [10] to reduce the computational burden. More precisely, as formally proved by [10], since the test statistic satisfies (4.1) below, it is sufficient to generate only one bootstrap sample in each Monte Carlo replication, say r = 1, … , R , and then evaluate the test against the empirical distribution of the R bootstrap statistics T * (1) n , … , T * (R) n . To this end, at any given level , 0 < < 1 , the empirical rejection rate of the null hypothesis, say n,R , is computed as where T (r) n denotes the test statistic at the rth Monte Carlo replication, r = 1, … , R. Note that, in the standard Monte Carlo bootstrap, at each Monte Carlo replication, one generates K bootstrap samples and compute the -level bootstrap critical value satisfying (2.6), say z * (K,r) , r = 1, … , R , and then compute the empirical rejection rate of the null hypothesis as Clearly one can compute n,R much more efficiently than computing (K) n,R , because in the computation of n,R the bootstrap statistic is only computed R times.…”