Universal configurations in light-flipping games

Authors:
Yevgeniy Dodis;Peter Winkler
Affiliations:
MIT Lab for Computer Science, 545 Technology Square, Cambridge, MA;Department of Fundamental Mathematics Research, Bell Labs, 700 Mountain Avenue, Murray Hill, NJ
Venue:
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Year:
2001

Citing 0
Cited 4

Chebyshev polynomials over finite fields and reversibility of σ-automata on square grids

Theoretical Computer Science
The general σ all-ones problem for trees

Discrete Applied Mathematics
Does the lit-only restriction make any difference for the σ-game and σ+-game?

European Journal of Combinatorics
The minimum all-ones problem for graphs with small treewidth

COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract