In computational complexity theory, generalized geography is a well-known PSPACE-complete problem.

(More)

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- Ã‰douard Bonnet, Florian Jamain, Abdallah Saffidine
- Theor. Comput. Sci.
- 2016

In this paper, we study three connection games among the most widely played: havannah, twixt, and slither. We show thatâ€¦Â (More)

Is this relevant?

2016

2016

- Matteo Anedda, Pablo Angueira, Javier Morgade, Maurizio Murroni
- Telecommunication Systems
- 2016

InDVB-T/T2 broadcasting single frequency network (SFN) multipath interference (MPI) at the receiver antenna is a critical issueâ€¦Â (More)

Is this relevant?

2013

2013

- Ã‰douard Bonnet, Florian Jamain, Abdallah Saffidine
- IJCAI
- 2013

Determining the complexity of perfect information trick-taking card games is a long standing open problem. This question is worthâ€¦Â (More)

Is this relevant?

2013

2013

- Ã‰douard Bonnet, Florian Jamain, Abdallah Saffidine
- Computers and Games
- 2013

Numerous popular abstract strategy games ranging from hex and havannah to lines of action belong to the class of connection gamesâ€¦Â (More)

Is this relevant?

2001

2001

We investigate the generation, propagation, and probabilistic hazard of tsunami spawned by oceanic asteroid impacts. The processâ€¦Â (More)

Is this relevant?

Highly Cited

1980

Highly Cited

1980

- David Lichtenstein, Michael Sipser
- J. ACM
- 1980

It is shown that, given an arbitrary GO position on an n Ã— n board, the problem of determining the winner is Pspace hard. Newâ€¦Â (More)

Is this relevant?