Pages that link to "Item:Q636279"
From MaRDI portal
The following pages link to On complexity of Ehrenfeucht-Fraïssé games (Q636279):
Displaying 14 items.
- An Ehrenfeucht-Fraïssé game approach to collapse results in database theory (Q870360) (← links)
- Ehrenfeucht-Fraïssé games in finite set theory (Q963464) (← links)
- On winning Ehrenfeucht games and monadic NP (Q1919539) (← links)
- Reactive synthesis from interval temporal logic specifications (Q2062122) (← links)
- On distinguishing sets of structures by first-order sentences of minimal quantifier rank (Q2333677) (← links)
- ON THE COMPLEXITY OF COMPUTING VALUES OF RESTRICTED GAMES (Q3021974) (← links)
- On the Complexity of Non-reversible Betting Games on Many-Valued Events (Q3163975) (← links)
- On the Complexity of n-Player Hackenbush (Q3400102) (← links)
- The Computational Complexity of Game Trees by Eigen-Distribution (Q3611985) (← links)
- Ehrenfeucht–Fraïssé Games on Linear Orders (Q3612654) (← links)
- More on the Ehrenfeucht–Fraisse game of length ω<sub>1</sub> (Q4790187) (← links)
- Complexity of Unordered CNF Games (Q5053069) (← links)
- On the Complexity of Counter Reachability Games (Q5168525) (← links)
- On the complexity of problems on simple games (Q5388151) (← links)
