Fundamentals of Computation Theory
From MaRDI portal
Publication:5492929
DOI10.1007/11537311zbMath1122.91018OpenAlexW2491671784MaRDI QIDQ5492929
Publication date: 20 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11537311
Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Stochastic games, stochastic differential games (91A15)
Related Items (6)
A CSP-Based Approach for Solving Parity Game ⋮ A Simple P-Matrix Linear Complementarity Problem for Discounted Games ⋮ Realizability makes a difference: a complexity gap for sink-finding in USOs ⋮ Unique sink orientations of grids ⋮ Cyclic games and linear programming ⋮ On Solving Mean Payoff Games Using Pivoting Algorithms
This page was built for publication: Fundamentals of Computation Theory
