Now showing items 1-2 of 2

    • Automatically improving constraint models in Savile Row 

      Nightingale, Peter; Akgün, Özgür; Gent, Ian P.; Jefferson, Christopher; Miguel, Ian; Spracklen, Patrick (2017-10) - Journal article
      When solving a combinatorial problem using Constraint Programming (CP) or Satisfiability (SAT), modelling and formulation are vital and difficult tasks. Even an expert human may explore many alternatives in modelling a ...
    • Classification and enumeration of finite semigroups 

      Distler, Andreas (University of St Andrews, 2010-06-23) - Thesis
      The classification of finite semigroups is difficult even for small orders because of their large number. Most finite semigroups are nilpotent of nilpotency rank 3. Formulae for their number up to isomorphism, and up ...