English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse
  1. View item / 
  2. Item Summary

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

The Complexity of Bidirected Reachability in Valence Systems

MPS-Authors
/persons/resource/persons266088

Ganardi,  Moses
Group G. Zetzsche, Max Planck Institute for Software Systems, Max Planck Society;

/persons/resource/persons144534

Majumdar,  Rupak
Group R. Majumdar, Max Planck Institute for Software Systems, Max Planck Society;

/persons/resource/persons230970

Zetzsche,  Georg
Group G. Zetzsche, Max Planck Institute for Software Systems, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

arXiv:2110.03654.pdf
(Preprint), 627KB

3531130.3533345.pdf
(Publisher version), 6MB

Supplementary Material (public)
There is no public supplementary material available
Citation

Ganardi, M., Majumdar, R., & Zetzsche, G. (2022). The Complexity of Bidirected Reachability in Valence Systems. In C. Baier, & D. Fisman (Eds.), Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 1-15). New York, NY: ACM. doi:10.1145/3531130.3533345.


Cite as: https://hdl.handle.net/21.11116/0000-0009-6F00-B
Abstract
There is no abstract available