Complexity and Limiting Ratio of Boolean Functions over Implication. - Archive ouverte HAL Access content directly
Conference Papers Year : 2008

Complexity and Limiting Ratio of Boolean Functions over Implication.

Domains

Data Structures and Algorithms [cs.DS]

Antoine Genitrini  : Connect in order to contact the contributor

https://hal.science/hal-00530525

Submitted on : Friday, October 29, 2010-10:53:24 AM

Last modification on : Tuesday, March 5, 2024-9:18:04 AM

No file

Dates and versions

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

Identifiers

  • HAL Id : hal-00530525 , version 1

Cite

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⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS UVSQ
19 View
0 Download

Share

Gmail Facebook X LinkedIn More