Ackermannian completion of separators

DOI10.1007/978-3-031-57228-9_1MaRDI QIDQ6629446FDOQ6629446

Authors: Jérôme Leroux 

Publication date: 30 October 2024

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites Work

• Semigroups, Presburger formulas, and languages
• Parallel program schemata
• The Complexity of the Finite Containment Problem for Petri Nets
• Title not available (Why is that?)
• Complexity hierarchies beyond elementary
• Hierarchies of number-theoretic functions. I
• On the reachability problem for 5-dimensional vector addition systems
• A structure to decide reachability in Petri nets
• Title not available (Why is that?)
• An Algorithm for the General Petri Net Reachability Problem
• Demystifying Reachability in Vector Addition Systems
• Improved Ackermannian lower bound for the Petri nets reachability problem

This page was built for publication: Ackermannian completion of separators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6629446)