3172 search results - page 32 / 635 » On the Random-Self-Reducibility of Complete Sets |
IPOM
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. Flow-based intrusion detection has recently become a promising security mechanism in high speed networks (1-10 Gbps). Despite the richness in contributions in this field...
STACS
2007
Springer
14 years 5 months ago
2007
Springer
This paper is motivated by the open question whether the union of two disjoint NPcomplete sets always is NP-complete. We discover that such unions retain much of the complexity of...
ICLP
2005
Springer
14 years 4 months ago
2005
Springer
Answer set programming (ASP for short) is a declarative problem solving framework that has been recently attracting the attention of researchers for its expressiveness and for its...
LPNMR
2004
Springer
14 years 4 months ago
2004
Springer
We investigate a generalization of weight-constraint programs with stable semantics, as implemented in the ASP solver smodels. Our programs admit atoms of the form X, F where X is ...
IFIPTCS
2010
13 years 9 months ago
2010
Abstract. We investigate systematically into the various possible notions of traceable sets and the relations they bear to each other and to other notions such as diagonally noncom...