Complexity of question/answer games
From MaRDI portal
Publication:2378516
DOI10.1016/j.tcs.2008.08.034zbMath1155.91010OpenAlexW2089085890MaRDI QIDQ2378516
Publication date: 8 January 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.08.034
Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05) Games involving graphs (91A43)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solution of Ulam's problem on searching with a lie
- Ulam's searching game with a fixed number of lies
- The polynomial-time hierarchy
- On the complexity of deadlock detection in families of planar nets
- Complexity of question/answer games
- A Combinatorial Problem Which Is Complete in Polynomial Space
- Mathematical Foundations of Computer Science 2003
- Searching games with errors -- fifty years of coping with liars