Titel

Merkliste
1 Ergebnisse

A subexponential lower bound for the random facet algorithm..:

, In: Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete algorithms,

Friedmann, Oliver ; Hansen, Thomas Dueholm ; Zwick, Uri - p. 202-216 , 2011

Link: https://dl.acm.org/doi/10.5555/2133036.2133055

RT 
T1 <cTitle>Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete algorithms</cTitle>: T1 <Title>A subexponential lower bound for the random facet algorithm for parity games</Title>

UL https://suche.suub.uni-bremen.de/peid=acm-2133055&Exemplar=1&LAN=DE
				
A1 Friedmann, Oliver
A1 Hansen, Thomas Dueholm
A1 Zwick, Uri
PB Society for Industrial and Applied Mathematics
YR 2011
K1 Theory of computation
K1 Design and analysis of algorithms
K1 Theory and algorithms for application domains
K1 Algorithmic game theory and mechanism design
K1 Mathematics of computing
K1 Discrete mathematics
K1 Combinatorics
K1 Combinatorial algorithms
K1 Information systems
K1 Information systems applications
K1 Multimedia information systems
K1 Massively multiplayer online games
K1 Applied computing
K1 Computers in other domains
K1 Personal computers and PC applications
K1 Computer games
K1 Software and its engineering
K1 Software organization and properties
K1 Contextual software domains
K1 Virtual worlds software
K1 Interactive games
SP 202
OP 216
LK http://dx.doi.org/https://dl.acm.org/doi/10.5555/2133036.2133055
DO https://dl.acm.org/doi/10.5555/2133036.2133055
SF ELIB - SuUB Bremen

Export

RefWorks (nur Desktop-Version!)
Flow (Zuerst in Flow einloggen, dann importieren)