11 search results - page 2 / 3 » Communicating ASP and the Polynomial Hierarchy |
IFIP
2004
Springer
13 years 10 months ago
2004
Springer
We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We ...
ICC
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract—Secure multicast has become an important component of many applications in wireless networks. In this paper, we investigate secure intra and inter group information shar...
IFIP
2004
Springer
13 years 10 months ago
2004
Springer
In this paper we study the complexity of the model-checking problem for the tree logic introduced as the basis for the query language TQL [Cardelli and Ghelli, 2001]. We define tw...
ARGMAS
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. In this paper, we propose a new strategic and tactic reasoning for agent communication. This reasoning framework is specified using argumentation theory combined to a rel...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract Anna Blasiak Robert Kleinberg Eyal Lubetzky Index Coding has received considerable attention recently motivated in part by applications such as fast video-on-demand and e...