46 search results - page 5 / 10 » The Descriptive Complexity of Parity Games |
TCOM
2011
13 years 2 months ago
2011
—Low-density parity-check (LDPC) codes are gaining interest for high data rate applications in both terrestrial and spatial communications. They can be designed and studied throu...
ICC
2008
IEEE
14 years 2 months ago
2008
IEEE
— Low-Density Parity-Check (LDPC) codes are typically characterized by a relatively high-complexity description, since a considerable amount of memory is required in order to sto...
ITA
2007
13 years 7 months ago
2007
Abstract. This paper analyses the complexity of model checking Fixpoint Logic with Chop – an extension of the modal µ-calculus with a sequential composition operator. It uses tw...
MHCI
2009
Springer
14 years 2 months ago
2009
Springer
Mobile devices became powerful recently and wireless Internet access is becoming standard. One important class of networked, mobile applications are location based games, making e...
FSTTCS
2008
Springer
13 years 8 months ago
2008
Springer
We consider an extension of Church’s synthesis problem to ordinals by adding limit transitions to graph games. We consider game arenas where these limit transitions are defined...