15033 search results - page 178 / 3007 » Complexity Theory and Algorithms |
134
click to vote
SIGECOM
2010
ACM
15 years 9 months ago
2010
ACM
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
144
Voted
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constr...
120
Voted
AIML
2004
15 years 5 months ago
2004
In this paper we give the notion of modularity of a theory and analyze some of its properties, especially for the case of action theories in reasoning about actions. We propose alg...
146
click to vote
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
The paper applies modal logic to formalize fragments of argumentation theory. Such formalization allows to import, for free, a wealth of new notions (e.g., argument equivalence), ...
137
click to vote
CSL
2010
Springer
15 years 5 months ago
2010
Springer
We introduce two-sorted theories in the style of [CN10] for the complexity classes L and DET, whose complete problems include determinants over Z2 and Z, respectively. We then desc...