Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:2920125
Jump to:navigation, search

DOI10.4230/LIPIcs.FSTTCS.2009.2317zbMath1248.68202MaRDI QIDQ2920125

Oded Lachish, Ranko Lazić, Stéphane P. Demri, Marcin Jurdziński

Publication date: 24 October 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_ef7f.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexitycoveringboundednessPetri netsvector addition systems


Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)


Related Items (1)

The reachability problem for branching vector addition systems requires doubly-exponential space







This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2920125&oldid=15892873"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 20:13.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki