Applications of the complexity space to the general probabilistic divide and conquer algorithms (Q947570)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Applications of the complexity space to the general probabilistic divide and conquer algorithms |
scientific article; zbMATH DE number 5349094
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Applications of the complexity space to the general probabilistic divide and conquer algorithms |
scientific article; zbMATH DE number 5349094 |
Statements
Applications of the complexity space to the general probabilistic divide and conquer algorithms (English)
0 references
6 October 2008
0 references
complexity quasi-metric space
0 references
Smyth complete
0 references
fixed point
0 references
improver
0 references
recurrence
0 references
probabilistic divide and conquer algorithm
0 references
0.8105539679527283
0 references
0.8104824423789978
0 references
0.7788400650024414
0 references
0.7582119703292847
0 references
