Pages that link to "Item:Q3768402"
From MaRDI portal
The following pages link to The complexity of problems on probabilistic, nondeterministic, and alternating decision trees (Q3768402):
Displayed 11 items.
- Lower bounds to randomized algorithms for graph properties (Q808708) (← links)
- A probabilistic distributed algorithm for set intersection and its analysis (Q1088406) (← links)
- Geometric complexity of some location problems (Q1099951) (← links)
- Obtaining lower bounds using artificial components (Q1107991) (← links)
- A lower bound for randomized algebraic decision trees (Q1386178) (← links)
- Randomization and the computational power of analytic and algebraic decision trees (Q1386179) (← links)
- Decision trees: Old and new results. (Q1854291) (← links)
- On the decisional complexity of problems over the reals (Q1854429) (← links)
- Decomposing probabilistic lambda calculi (Q2200818) (← links)
- (Q3792250) (← links)
- COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS (Q4682203) (← links)