1245 search results - page 1 / 249 » Playing with Conway's problem |
TCS
2008
13 years 4 months ago
2008
CORR
2000
Springer
13 years 4 months ago
2000
Springer
We show that, in John Conway's board game Phutball (or Philosopher's Football), it is NP-complete to determine whether the current player has a move that immediately wins...
ICSE
1999
IEEE-ACM
13 years 8 months ago
1999
IEEE-ACM
It is widely acknowledged that coordination of large scale software development is an extremely difficult and persistent problem. Since the structure of the code mirrors the struc...
COMPGEOM
1995
ACM
13 years 8 months ago
1995
ACM
A thrackle is a graph drawn in the plane so that its edges are represented by Jordan arcs and any two distinct arcs either meet at exactly one common vertex or cross at exactly on...
TAMC
2007
Springer
13 years 10 months ago
2007
Springer
The Collatz problem, widely known as the 3x + 1 problem, asks whether or not a certain simple iterative process halts on all inputs. We build on earlier work by J. H. Conway, and ...