"On the algorithmic complexity of two player zero-sum games of finite ..."

Soumyajit Paul (2023)

> Home

Details and statistics

DOI: —

access: closed

type: Book or Thesis

metadata version: 2024-06-05

- view
  - electronic edition @ archives-ouvertes.fr
- export record
  dblp key:
  - phd/hal/Paul23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/phd/hal/Paul23
Soumyajit Paul:
On the algorithmic complexity of two player zero-sum games of finite duration with imperfect information. (Sur la complexité des jeux à somme nulle à deux joueurs de durée finie avec information imparfaite). University of Bordeaux, France, 2023

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.