The following pages link to (Q3924096):
Displaying 9 items.
- On the computational complexity of qualitative coalitional games (Q814613) (← links)
- A method for obtaining efficient lower bounds for monotone complexity (Q1112792) (← links)
- A near-optimal method for reasoning about action (Q1134756) (← links)
- The game of ''\(N\) questions'' of a tree (Q1243263) (← links)
- On almost bad Boolean bases (Q1349706) (← links)
- On algorithm complexity (Q2453388) (← links)
- On the computational complexity of coalitional resource games (Q2457612) (← links)
- Parallelizable algebras (Q3773330) (← links)
- Branching program size is almost linear in formula size (Q5956012) (← links)
