Characterizing switch-setting problems∗
From MaRDI portal
Publication:4376554
DOI10.1080/03081089708818520zbMath0890.15004OpenAlexW1998859367MaRDI QIDQ4376554
William F. Klostermeyer, John L. Goldwasser, George E. Trapp
Publication date: 29 June 1998
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081089708818520
Analysis of algorithms and problem complexity (68Q25) Theory of matrix inversion and generalized inverses (15A09) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)
Related Items
Parity Dimension for Graphs - A Linear Algebraic Approach ⋮ “Lights Out” and Variants ⋮ Random Lights Out processes on graphs ⋮ Unnamed Item ⋮ Lights Out On A Random Graph ⋮ On the complexity of dominating set problems related to the minimum all-ones problem ⋮ Note on the lamp lighting problem ⋮ Minimum light number of lit-only \(\sigma\)-game on a tree ⋮ Chasing the Lights in Lights Out ⋮ Maximum orbit weights in the \(\sigma \)-game and lit-only \(\sigma \)-game on grids and graphs ⋮ A Survey of the Game “Lights Out!” ⋮ Lights Out on graphs ⋮ The density of ones in Pascal's rhombus ⋮ Cyclic mutually unbiased bases, Fibonacci polynomials and Wiedemann's conjecture
Cites Work
