Pages that link to "Item:Q3611985"
From MaRDI portal
The following pages link to The Computational Complexity of Game Trees by Eigen-Distribution (Q3611985):
Displaying 8 items.
- Randomized vs. deterministic decision tree complexity for read-once Boolean functions (Q685705) (← links)
- The eigen-distribution of weighted game trees (Q1699791) (← links)
- Computing branching distances with quantitative games (Q2210522) (← links)
- Eigen-distribution on random assignments for game trees (Q2380000) (← links)
- A game characterisation of tree-like Q-resolution size (Q2424676) (← links)
- The eigen-distribution for multi-branching weighted trees on independent distributions (Q2671226) (← links)
- The Variance of Two Game Tree Algorithms (Q4216144) (← links)
- The equilibria of independent distributions on unbalanced game trees (Q6563148) (← links)