default search action

combined dblp search
author search
venue search
publication search

ask others

"Improved Ackermannian Lower Bound for the Petri Nets Reachability Problem."

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

Slawomir Lasota (2022)

> Home

Details and statistics

DOI: 10.4230/LIPICS.STACS.2022.46

access: open

type: Conference or Workshop Paper

metadata version: 2022-03-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/stacs/000122
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stacs/000122
Slawomir Lasota:
Improved Ackermannian Lower Bound for the Petri Nets Reachability Problem. STACS 2022: 46:1-46:15

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.

last updated on 2022-03-12 15:06 CET by the dblp team

all metadata released as open data under CC0 1.0 license

see also: Terms of Use | Privacy Policy | Imprint

dblp was originally created in 1993 at:

since 2018, dblp has been operated, funded, and maintained by:

Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.