800 search results - page 17 / 160 » On the Complexity of Parity Games |
ICC
2007
IEEE
14 years 4 months ago
2007
IEEE
Abstract— In this paper, we present a simple statistical simulation technique for channels with long memory operating under coded data. The proposed technique employs a divideand...
DAM
1999
13 years 9 months ago
1999
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
CORR
2011
Springer
13 years 1 months ago
2011
Springer
Complementation of finite automata on infinite words is not only a fundamental problem in automata theory, but also serves as a cornerstone for solving numerous decision problem...
FOSSACS
2009
Springer
14 years 4 months ago
2009
Springer
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...
DEXAW
2005
IEEE
14 years 3 months ago
2005
IEEE
A most critical and complex issue with regard to constrained devices in the ubiquitous and pervasive computing setting is secure key exchange. The restrictions motivate the invest...