Sciweavers

STOC
2001
ACM
140views Algorithms» more  STOC 2001»
14 years 5 months ago
Compatible sequences and a slow Winkler percolation
Two infinite 0-1 sequences are called compatible when it is possible to cast out 0's from both in such a way that they become complementary to each other. Answering a question...
Péter Gács