A deletion game on hypergraphs

Authors:
Aviezri S. Fraenkel;Edward R. Scheinerman
Affiliations:
-;-
Venue:
ARIDAM III Selected papers on Third advanced research institute of discrete applied mathematics
Year:
1991

Citing 0
Cited 2

Complexity, appeal and challenges of combinatorial games

Theoretical Computer Science - Algorithmic combinatorial game theory
Deciding the winner of an arbitrary finite poset game is PSPACE-Complete

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract