On some conditioning results in the probabilistic analysis of algorithms (Q1063418)
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: On some conditioning results in the probabilistic analysis of algorithms |
scientific article; zbMATH DE number 3917728
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On some conditioning results in the probabilistic analysis of algorithms |
scientific article; zbMATH DE number 3917728 |
Statements
On some conditioning results in the probabilistic analysis of algorithms (English)
0 references
1985
0 references
A simple combinatorial approach is given for handling certain conditioning problems that arise in the probabilistic analysis of graph algorithms.
0 references
probabilistic analysis of graph algorithms
0 references
