On the complexity of connection games
Bonnet, Édouard and Jamain, F and Saffidine, A (2016) On the complexity of connection games. THEORETICAL COMPUTER SCIENCE, 644. pp. 2-28. ISSN 0304-3975 10.1016/j.tcs.2016.06.033
![[img]](https://eprints.sztaki.hu/style/images/fileicons/text.png) |
Text
Bonet_2_3173321_z.pdf Restricted to Registered users only Download (1MB) |
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | Computer science; Computational methods; Twixt; Slither; PSPACE; HEX; Havannah; COMPLEXITY |
| Subjects: | Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány |
| Divisions: | Artificial Intelligence Laboratory |
| SWORD Depositor: | MTMT Injector |
| Depositing User: | MTMT Injector |
| Date Deposited: | 29 Jan 2017 20:25 |
| Last Modified: | 29 Jan 2017 20:25 |
| URI: | https://eprints.sztaki.hu/id/eprint/9032 |
 |
Update Item |
