Pages that link to "Item:Q935154"
From MaRDI portal
The following pages link to A randomized competitive algorithm for evaluating priced AND/OR trees (Q935154):
Displaying 5 items.
- Revisiting the complexity of and/or graph solution (Q394337) (← links)
- And/or-convexity: a graph convexity based on processes and deadlock models (Q1639288) (← links)
- Tractability, hardness, and kernelization lower bound for and/or graph solution (Q2410230) (← links)
- Uniqueness of optimal randomized algorithms for balanced AND-OR trees (Q5047116) (← links)
- STACS 2004 (Q5309726) (← links)