Sciweavers

FOSSACS
2004
Springer
14 years 4 months ago
Hypergraphs and Degrees of Parallelism: A Completeness Result
Abstract. In order to study relative PCF-definability of boolean functions, we associate a hypergraph Hf to any boolean function f (following [3, 5]). We introduce the notion of t...
Antonio Bucciarelli, Benjamin Leperchey