Non-Elementary Complexities for Branching VASS, MELL, and Extensions - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue ACM Transactions on Computational Logic Année : 2015

Non-Elementary Complexities for Branching VASS, MELL, and Extensions

Résumé

We study the complexity of reachability problems on branching extensions of vector addition systems, which allows us to derive new non-elementary complexity bounds for fragments and variants of propositional linear logic. We show that provability in the multiplicative exponential fragment is TOWER-hard already in the affine case—and hence non-elementary. We match this lower bound for the full propositional affine linear logic, proving its TOWER-completeness. We also show that provability in propositional contractive linear logic is ACKERMANN-complete.

Dates et versions

hal-01168290 , version 1 (25-06-2015)

Identifiants

Citer

Ranko Lazić, Sylvain Schmitz. Non-Elementary Complexities for Branching VASS, MELL, and Extensions. ACM Transactions on Computational Logic, 2015, 16 (3:20), pp.1--30. ⟨10.1145/2733375⟩. ⟨hal-01168290⟩
67 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More