549 search results - page 18 / 110 » On the Complexity of Restricted k-anonymity Problem |
CORR
2006
Springer
14 years 9 months ago
2006
Springer
XPath is a simple language for navigating an XML-tree and returning a set of answer nodes. The focus in this paper is on the complexity of the containment problem for various frag...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Modal logics are widely used in computer science. The complexity of modal satisfiability problems has been investigated since the 1970s, usually proving results on a case-by-case b...
111
click to vote
SIAMCOMP
2011
14 years 4 months ago
2011
Abstract. In the 2nd Annual FOCS (1961), Chao-Kong Chow proved that every Boolean threshold function is uniquely determined by its degree-0 and degree-1 Fourier coefficients. These...
ECAI
1998
Springer
15 years 2 months ago
1998
Springer
Abstract. Default logic is one of the most widely used formalisms to formalize commonsense reasoning. In this paper we analyze the complexity of deciding whether a propositional in...
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
We analyse the computational complexity of finding Nash equilibria in simple stochastic multiplayer games. We show that restricting the search space to equilibria whose payoffs fal...