Nonelementary Complexities for Branching VASS, MELL, and Extensions (Q2946760): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
aliases / en / 0aliases / en / 0
 
Non-elementary complexities for branching VASS, MELL, and extensions
description / endescription / en
scientific article
scientific article; zbMATH DE number 6863119
Property / title
 
Non-elementary complexities for branching VASS, MELL, and extensions (English)
Property / title: Non-elementary complexities for branching VASS, MELL, and extensions (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1394.68189 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1145/2603088.2603129 / rank
 
Normal rank
Property / published in
 
Property / published in: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) / rank
 
Normal rank
Property / publication date
 
23 April 2018
Timestamp+2018-04-23T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 23 April 2018 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6863119 / rank
 
Normal rank
Property / zbMATH Keywords
 
substructural logic
Property / zbMATH Keywords: substructural logic / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2568513581 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2221764640 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1401.6785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Parity Games on Integer Vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intuitionistic Light Affine Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-variable logic on data trees and XML reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of recursively parallel programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating Vector Addition Systems with States / rank
 
Normal rank
Property / cites work
 
Property / cites work: The covering and boundedness problems for branching vector addition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Petri nets, Horn programs, linear logic and vector games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of linear affine logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The finite model property for various fragments of linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic Phase Semantics and the Undecidability of Boolean BI / rank
 
Normal rank
Property / cites work
 
Property / cites work: The reachability problem for branching vector addition systems requires doubly-exponential space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision problems for propositional linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchies of number-theoretic functions. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of the Finite Containment Problem for Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The finite model property for various fragments of intuitionistic linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The covering and boundedness problems for vector addition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Hierarchies beyond Elementary / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rewriting and typed lambda calculi. Joint international conference, RTA-TLCA 2014, held as part of the Vienna summer of logic, VSL 2014, Vienna, Austria, July 14--17, 2014. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of decision procedures in relevance logic II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4944927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5387658 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:31, 10 July 2024

scientific article; zbMATH DE number 6863119
  • Non-elementary complexities for branching VASS, MELL, and extensions
Language Label Description Also known as
English
Nonelementary Complexities for Branching VASS, MELL, and Extensions
scientific article; zbMATH DE number 6863119
  • Non-elementary complexities for branching VASS, MELL, and extensions

Statements

Nonelementary Complexities for Branching VASS, MELL, and Extensions (English)
0 references
Non-elementary complexities for branching VASS, MELL, and extensions (English)
0 references
0 references
0 references
17 September 2015
0 references
23 April 2018
0 references
fast-growing complexity
0 references
linear logic
0 references
vector addition systems
0 references
substructural logic
0 references
0 references
0 references
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references