Sublogarithmic uniform Boolean proof nets

Abstract : Cut-elimination in proof nets for Multiplicative Linear Logic and evaluation in Boolean circuits may be linked using the proofs-as-programs correspondence. Those two models of parallel computation offer a framework where we can study uniformity and implicit complexity. Boolean proof nets were introduced by [Terui, 2004] and studied by [Mogbil & Rahli, 2007] to compare the computational power of proof nets and of Boolean circuits. They established inclusions between classes of complexity that could not be extended to sublogarithmic classes as AC0 and NC1. By restricting the way Boolean proof nets are built we prove anew those inclusion results -- in an uniform framework -- and extend them to small classes of complexity.
Type de document :
Communication dans un congrès
Developments in Implicit Computational Complexity, Apr 2011, Sarrebruck, Germany. 75, pp.15--27, 2012, 〈10.4204/EPTCS.75.2〉
Liste complète des métadonnées

Littérature citée [9 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00555403
Contributeur : Clément Aubert <>
Soumis le : jeudi 13 janvier 2011 - 12:13:54
Dernière modification le : jeudi 11 janvier 2018 - 06:17:31
Document(s) archivé(s) le : mardi 6 novembre 2012 - 11:25:15

Fichier

Sublogarithmic_uniform_boolean...
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Clément Aubert. Sublogarithmic uniform Boolean proof nets. Developments in Implicit Computational Complexity, Apr 2011, Sarrebruck, Germany. 75, pp.15--27, 2012, 〈10.4204/EPTCS.75.2〉. 〈hal-00555403〉

Partager

Métriques

Consultations de la notice

180

Téléchargements de fichiers

72