Pages that link to "Item:Q5694972"
From MaRDI portal
The following pages link to The complexity of recursion theoretic games (Q5694972):
Displaying 12 items.
- A note on degrees of presentation of games as relational structures (Q912772) (← links)
- Recursively presented games and strategies (Q1196205) (← links)
- Nondeterminacy and recursion via stacks and games (Q1318704) (← links)
- Expository notes on computability and complexity in (arithmetical) games (Q1391661) (← links)
- The recursive core for non-superadditive games (Q2344928) (← links)
- ON THE COMPLEXITY OF COMPUTING VALUES OF RESTRICTED GAMES (Q3021974) (← links)
- Recursive algorithm for parity games requires exponential time (Q3117548) (← links)
- (Q3390731) (← links)
- (Q4464562) (← links)
- Recursive comparison tests for dicot and dead-ending games under misère play (Q5041715) (← links)
- Complexity of Unordered CNF Games (Q5053069) (← links)
- On the Complexity of Counter Reachability Games (Q5168525) (← links)