Exploració per tema "Boolean formulas"

Ara es mostren els items 1-4 de 4

    • A Dichotomy theorem for learning quantified Boolean formulas 

      Dalmau Lloret, Víctor (1997-03)
      Report de recerca
      Accés obert
      We consider the following classes of quantified boolean formulas. Fix a finite set of basic boolean functions. Take conjunctions of these basic functions applied to variables and constants in arbitrary way. Finally ...

    • Exact learning of subclasses of CDNF formulas with membership queries 

      Domingo, Carlos (1996-03-01)
      Report de recerca
      Accés obert
      We consider the exact learnability of subclasses of Boolean formulas from membership queries alone. We show how to combine known learning algorithms that use membership and equivalence queries to obtain new learning ...

    • On the complexity of game isomorphism 

      Gabarró Vallès, Joaquim; Garcia, Alina; Serna Iglesias, María José (2007-06)
      Report de recerca
      Accés obert
      We consider the question of when two games are equivalent and the computational complexity of deciding such a property for strategic games. We introduce three types of isomorphisms depending on which structure of the game ...

    • The Complexity of game isomorphism 

      Gabarró Vallès, Joaquim; García, Alina; Serna Iglesias, María José (2010)
      Report de recerca
      Accés obert
      We address the question of whether two multiplayer strategic games are equivalent and the computational complexity of deciding such a property. We introduce two notions of isomorphisms, strong and weak. Each one of those ...