Complexity and Limiting Ratio of Boolean Functions over Implication. - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

Complexity and Limiting Ratio of Boolean Functions over Implication.

Fichier non déposé

Dates et versions

hal-00530525 , version 1 (29-10-2010)

Identifiants

  • HAL Id : hal-00530525 , version 1

Citer

Hervé Fournier, Danièle Gardy, Antoine Genitrini, Bernhard Gittenberger. Complexity and Limiting Ratio of Boolean Functions over Implication.. 33rd International Symposium on Mathematical Foundations of Computer Science, 2008, Torun, Poland. pp.347-362. ⟨hal-00530525⟩

Collections

CNRS UVSQ
19 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More