2446 search results - page 306 / 490 » Choiceless Polynomial Time |
157
Voted
CATS
2008
15 years 5 months ago
2008
The problem of deciding whether the edge-set of a given graph can be partitioned into at most k cliques is well known to be NP-complete. In this paper we investigate this problem ...
137
Voted
IPCO
2007
15 years 5 months ago
2007
According to the present state of the theory of the matroid matching problem, the existence of a good characterization to the size of a maximum matching depends on the behavior of ...
111
Voted
AAAI
2006
15 years 5 months ago
2006
We investigate the modelling of workflows, plans, and other event-generating processes as discrete event sources and reason about the possibility of having event sequences ending ...
161
Voted
ACID
2006
15 years 5 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...
113
Voted
DLOG
2004
15 years 5 months ago
2004
Recently, it was shown for the DL EL that subsumption and instance problem w.r.t. cyclic terminologies can be decided in polynomial time. In this paper, we show that both problems...