The complexity of recursive splittings of random sets (Q4979763)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6305363
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of recursive splittings of random sets |
scientific article; zbMATH DE number 6305363 |
Statements
The Complexity of Recursive Splittings of Random Sets (English)
0 references
19 June 2014
0 references
computability
0 references
algorithmic randomness
0 references
splitting
0 references
0.7659214735031128
0 references
0.7433181405067444
0 references
0.7432045340538025
0 references
0.7389340996742249
0 references
