1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.CC2024
Parks: A Doubly Infinite Family of NP-Complete Puzzles and Generalizations of A002464
Igor Minevich, Gabe Cunningham, Aditya Karan +1
The Parks Puzzle is a paper-and-pencil puzzle game that is classically played on a square grid with different colored regions (the parks). The player needs to place a certain numbe…
math.RA2012★ 1 cited
Symmetric Matrices over F_2 and the Lights Out Problem
Igor Minevich
We prove that the range of a symmetric matrix over F_2 contains the vector of its diagonal elements. We apply the theorem to a generalization of the "Lights Out" problem on graphs.
math.NT2012
Elliptic Curves with Supersingular Reduction over -extensions
Igor Minevich, Florian Sprung
This is a translation of a research announcement by Anas G. Nasybullin from 1976, in which he states formulas for the p-primary part of the Tate-Shafarevich group of an elliptic cu…