Gaussian Elimination versus Greedy Methods for the Synthesis of Linear Reversible Circuits — mentioned by fuglede_

Mon, 29 Sep 2025 13:58:45 GMT

Thanks for sharing your thoughts! I know of some work on trying out various heuristics for A*; Section 5 of https://arxiv.org/pdf/2201.06508 gives some examples of what works and what doesn't. I don't think D* Lite specifically has ever featured. There's plenty of room for trying to come up with other heuristics, and just for other takes in general. > But for bigger boards you won't be able to materialize the whole graph. If we restrict to boards corresponding to solvable puzzles, the number of vertices is https://oeis.org/A002884 (1, 1, 6, 168, 20160, 9999360, 20158709760, …) and indeed…

Paper and discussion history. A mention is not an endorsement.

Gaussian Elimination versus Greedy Methods for the Synthesis of Linear Reversible Circuits · HackerPapers discussions

Gaussian Elimination versus Greedy Methods for the Synthesis of Linear Reversible Circuits — mentioned by fuglede_