Complexity and Limiting Ratio of Boolean Functions over Implication.

Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00530525
Contributor : Antoine Genitrini <>
Submitted on : Friday, October 29, 2010 - 10:53:24 AM
Last modification on : Thursday, January 11, 2018 - 6:21:30 AM

Identifiers

  • HAL Id : hal-00530525, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

66