9842 search results - page 110 / 1969 » The Complexity of the Matching-Cut Problem |
DESRIST
2010
Springer
14 years 3 days ago
2010
Springer
Abstract. Just recently many organisations get involved with process performance management (PPM). It appears, however, that PPM initiatives confront organisations with multi-facet...
ACID
2006
13 years 11 months ago
2006
Matroid theory gives us powerful techniques for understanding combinatorial optimization problems and for designing polynomial-time algorithms. However, several natural matroid pr...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
In this report, we describe three encodings of the multiple constant multiplication (MCM) problem to pseudo-boolean satisfiability (PBS), and introduce an algorithm to solve the M...
LPAR
2000
Springer
14 years 1 months ago
2000
Springer
In this paper, we determine the complexity of propositional theory curbing. Theory Curbing is a nonmonotonic technique of common sense reasoning that is based on model minimality b...
AAAI
1990
13 years 11 months ago
1990
Closed world reasoning is a common nonmonotonic technique that allows for dealing with negative information in knowledge and data bases. We present a detailed analysis of the comp...