2 citations · 4 across the 5 of their papers we have counts for
5 papers
Faster Symmetry Breaking Constraints for Abstract Structures
Özgür Akgün, Mun See Chang, Ian P. Gent +1
In constraint programming and related paradigms, a modeller specifies their problem in a modelling language for a solver to search and return its solution(s). Using high-level mode…
Towards Automatic Design of Factorio Blueprints
Sean Patterson, Joan Espasa, Mun See Chang +1
Factorio is a 2D construction and management simulation video game about building automated factories to produce items of increasing complexity. A core feature of the game is its b…
Computing normalisers of intransitive groups
Mun See Chang, Christopher Jefferson, Colva M. Roney-Dougal
The normaliser problem takes as input subgroups and of the symmetric group , and asks one to compute . The fastest known algorithm for this problem is simply e…
Primitive normalisers in quasipolynomial time
Mun See Chang, Colva M. Roney-Dougal
The normaliser problem has as input two subgroups and of the symmetric group , and asks for a generating set for : it is not known to have a subexponential tim…
Disjoint direct product decomposition of permutation groups
Mun See Chang, Christopher Jefferson
Let be an intransitive group with orbits . Then certainly is a subdirect product of the direct product of its projections on each orbit, $H|…