Can the Measure of ∪ n 1 [ a i , b i ] be Computed in Less Than O(n logn) Steps? (Q3405831)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Can the Measure of ∪ n 1 [ a i , b i ] be Computed in Less Than O(n logn) Steps? |
scientific article |
Statements
Can the Measure of ∪ n 1 [ a i , b i ] be Computed in Less Than O(n logn) Steps? (English)
0 references
11 February 2010
0 references
