1 citations · 1 across the 2 of their papers we have counts for
2 papers
math.CO2023
On the Number of Distinct Tilings of Finite Subsets of With Tiles of Fixed Size
Jesse Stern
In this work, we study the number of finite tiles of size that translationally tile a finite . We consider two tiles and $A…
cs.CC2011★ 1 cited
Spider Solitaire is NP-Complete
Jesse Stern
This project investigates the potential of computers to solve complex tasks such as games. The paper proves that the complexity of a generalized version of spider solitaire is NP-C…