3 citations · 4 across the 7 of their papers we have counts for
7 papers
Solving Shisen-Sho boards
Michiel de Bondt
We give a simple proof of that determining solvability of Shisen-Sho boards is NP-complete. Furthermore, we show that under realistic assumptions, one can compute in logarithmic ti…
Slowly synchronizing DFAs of 7 states and maximal slowly synchronizing DFAs
Michiel de Bondt
We compute all synchronizing DFAs with 7 states and synchronization length >= 29. Furthermore, we compute alphabet size ranges for maximal, minimal and semi-minimal synchronizing D…
Subset synchronization of DFAs and PFAs, and some other results
Michiel de Bondt
This paper contains results which arose from the research which led to arXiv:1801.10436, but which did not fit in arXiv:1801.10436. So arXiv:1801.10436 contains the highlight resul…
Quadratic homogeneous polynomial maps and Keller maps with
Michiel de Bondt, Xiaosong Sun
We classify all quadratic homogeneous polynomial maps and Keller maps of the form , for which , over a field of arbitrary characteristic. In particular,…
Quadratic homogeneous polynomial maps and Keller maps with
Michiel de Bondt
We compute by hand all quadratic homogeneous polynomial maps and all Keller maps of the form , for which , over a field of arbitrary characteristic. Fu…
Fast algorithms for anti-distance matrices as a generalization of Boolean matrices
Michiel de Bondt
We show that Boolean matrix multiplication, computed as a sum of products of column vectors with row vectors, is essentially the same as Warshall's algorithm for computing the tran…