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
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.2307/2318871 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2327699610 / rank | |||
Normal rank | |||
Latest revision as of 02:25, 20 March 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
