Tiling with Three Polygons Is Undecidable (arxiv.org) | HN Screenshots

YHacker Newsscreenshots

Screenshot of arxiv.org: Tiling with Three Polygons Is Undecidable

First screen, captured 1 year ago.

Looks similar

Screenshot of arxiv.org: A convex polyhedron without Rupert's property

A convex polyhedron without Rupert's property (arxiv.org)

23 points by robinhouston 1 year ago | 3 comments

Screenshot of arxiv.org: Flip Distance of Convex Triangulations and Tree Rotation Is NP-Complete

Flip Distance of Convex Triangulations and Tree Rotation Is NP-Complete (arxiv.org)

22 points by nill0 8 months ago | 0 comments

Screenshot of arxiv.org: Flat origami is Turing complete (2023)

Flat origami is Turing complete (2023)(arxiv.org)

27 points by PaulHoule 1 year ago | 8 comments

Screenshot of arxiv.org: Conway and Doyle can divide by three, but I can't

Conway and Doyle can divide by three, but I can't (arxiv.org)

48 points by worez 3 years ago | 7 comments

Screenshot of arxiv.org: The Kernighan-Lin Search Algorithm

The Kernighan-Lin Search Algorithm (arxiv.org)

48 points by optimalsolver 1 year ago | 2 comments

Screenshot of arxiv.org: Reconfigurable Analog Computers

Reconfigurable Analog Computers (arxiv.org)

20 points by gidellav 11 months ago | 5 comments