Found 5 Documents (Results 1–5)
The fraction of large random trees representing a given Boolean function in implicational logic. (English) Zbl 1239.03004
Complexity and limiting ratio of Boolean functions over implication. (English) Zbl 1173.03301
Ochmański, Edward (ed.) et al., Mathematical foundations of computer science 2008. 33rd international symposium, MFCS 2008, Toruń Poland, August 25–29, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85237-7/pbk). Lecture Notes in Computer Science 5162, 347-362 (2008).
Filter Results by …
Document Type
- Journal Articles (4)
- Collection Articles (1)
all
top 5
Author
- Gittenberger, Bernhard (5)
- Gardy, Danièle (3)
- Genitrini, Antoine (3)
- Fournier, Hervé (2)
- Bodini, Olivier (1)
- de Panafieu, Elie (1)
- Gołȩbiewski, Zbigniew (1)
- Kraus, Veronika (1)
- Kuba, Markus F. (1)
- Mailler, Cécile (1)
Serial
- Discrete Appl. Math. (1)
- Theor. Comput. Sci. (1)
- Algorithmica (1)
- Random Struct. Algorithms (1)
