Sciweavers

COMBINATORICS
2006
108views more  COMBINATORICS 2006»
13 years 4 months ago
Dynamic Single-Pile Nim Using Multiple Bases
In the game G0 two players alternate removing positive numbers of counters from a single pile and the winner is the player who removes the last counter. On the first move of the g...
Arthur Holshouser, Harold Reiter
ANTS
1994
Springer
92views Algorithms» more  ANTS 1994»
13 years 8 months ago
The complexity of greatest common divisor computations
We study the complexity of expressing the greatest common divisor of n positive numbers as a linear combination of the numbers. We prove the NP-completeness of finding an optimal s...
Bohdan S. Majewski, George Havas