Can the Measure of ∪ n 1 [ a i , b i ] be Computed in Less Than O(n logn) Steps? (Q3405831): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:28, 4 February 2024
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
