COCOON
2000
Springer
13 years 8 months ago
2000
Springer
We consider the parameterized complexity of the following problem under the framework introduced by Downey and Fellows[4]: Given a graph G, an integer parameter k and a non-trivial...
COCOON
2000
Springer
13 years 8 months ago
2000
Springer
COCOON
2000
Springer
13 years 8 months ago
2000
Springer
COCOON
2000
Springer
13 years 8 months ago
2000
Springer
COCOON
2000
Springer
13 years 8 months ago
2000
Springer
The integer factorisation and discrete logarithm problems are of practical importance because of the widespread use of public key cryptosystems whose security depends on the presum...