Now showing items 1-3 of 3

    • Learning expressions and programs over monoids 

      Gavaldà Mestre, Ricard; Tesson, Pascal; Thérien, Denis (2001-09)
      Research report
      Open Access
      We study the problem of learning an unknown function represented as an expression or a program over a known finite monoid. As in other areas of computational complexity where programs over algebras have been used, the ...
    • Learning read-constant polynomials of constant degree modulo composites 

      Chattopadhyay, Arkadev; Gavaldà Mestre, Ricard; Arnsfelt Hansen, Kristoffer; Thérien, Denis (2014-08)
      Article
      Open Access
      Boolean functions that have constant degree polynomial representation over a fixed finite ring form a natural and strict subclass of the complexity class ACC0. They are also precisely the functions computable efficiently ...
    • Tractable clones of polynomials over semigroups 

      Dalmau, Víctor; Gavaldà Mestre, Ricard; Tesson, Pascal; Thérien, Denis (2005-12)
      Research report
      Open Access
      We contribute to the algebraic study of the complexity of constraint satisfaction problems. We give a new sufficient condition on a set of relations R over a domain S for the tractability of CSP(R): if S is a block-group ...