Hypergraphs and degrees of parallelism, a completeness result
Résumé
In order to study relative PCF-definability of boolean functions, we associate a hypergraph H_f to any boolean function f. We introduce the notion of timed hypergraph morphism and show that it is: - Sound: if there exists a timed morphism from H_f to H_g then f is PCF-definable relatively to g. - Complete for subsequential functions: if f is PCF-definable relatively to g, and g is subsequential, then there exists a timed morphism from H_f to H_g. We show that the problem of deciding the existence of a timed morphism between two given hypergraphs is NP-complete.
Domaines
Langage de programmation [cs.PL]
Loading...