Login / Signup
Deciding the Winner of an Arbitrary Finite Poset Game is PSPACE-Complete
Daniel Grier
Published in:
CoRR (2012)
Keyphrases
</>
pspace complete
np complete
model checking
satisfiability problem
decision problems
strips planning
partial order
game theory
game playing
totally ordered
relational databases
constraint satisfaction problems
partially ordered
coalition logic
objective function
causal graph
temporal logic
np hard
search space
search algorithm