9842 search results - page 67 / 1969 » The Complexity of the Matching-Cut Problem |
CAINE
2006
13 years 9 months ago
2006
There is a tendency to overlook or play down software issues in industrial systems design. However the very best hardware will only be as effective as the programs that control it...
JOC
2010
13 years 2 months ago
2010
Let g be an element of prime order p in an abelian group and let Zp. We show that if g, g , and gd are given for a positive divisor d of p - 1, the secret key can be computed de...
AIML
2004
13 years 9 months ago
2004
We study and give a summary of the complexity of 15 basic normal monomodal logics under the restriction to the Horn fragment and/or bounded modal depth. As new results, we show tha...
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
ICDT
1997
ACM
13 years 11 months ago
1997
ACM
Abstract Method invocation mechanism is one of the essential features in objectoriented programming languages. This mechanism contributes to data encapsulation and code reuse, but ...