549 search results - page 14 / 110 » On the Complexity of Restricted k-anonymity Problem |
COCO
2006
Springer
15 years 1 months ago
2006
Springer
We study the complexity of restricted versions of s-t-connectivity, which is the standard complete problem for NL. In particular, we focus on different classes of planar graphs, o...
IPL
2008
14 years 9 months ago
2008
In this note, we show, through the use of examples, how generic results for proving fixed-parameter tractability which apply to restricted classes of structures can sometimes be m...
JMLR
2010
14 years 4 months ago
2010
Logic-based probabilistic models (LBPMs) enable us to handle problems with uncertainty succinctly thanks to the expressive power of logic. However, most of LBPMs have restrictions...
106
click to vote
LICS
2012
IEEE
13 years 6 days ago
2012
IEEE
Abstract—We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying ...
SAT
2009
Springer
15 years 4 months ago
2009
Springer
Default logic was introduced by Reiter in 1980. In 1992, Gottlob classified the complexity of the extension existence problem for propositional default logic as Σp 2-complete, an...