Hypergraphs and degrees of parallelism, a completeness result - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2004

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.

Mots clés

Fichier principal
Vignette du fichier
24_0310pp_Bucciarelli.pdf (169.62 Ko) Télécharger le fichier
Loading...

Dates et versions

hal-00003584 , version 1 (15-12-2004)

Identifiants

  • HAL Id : hal-00003584 , version 1

Citer

Antonio Bucciarelli, Benjamin Leperchey. Hypergraphs and degrees of parallelism, a completeness result. Foundations of Software Science and Computation Structures 7th International Conference, FOSSACS 2004, 2004, Barcelone, Spain. pp.58-71. ⟨hal-00003584⟩
46 Consultations
97 Téléchargements

Partager

Gmail Facebook X LinkedIn More