Conceptio › Archive › arXiv (All)
arXiv (All)open access

The Complexity of Coverability-Like Problems in Elementary Object Systems: Data-Nets to the Rescue

Di Cosmo, Francesco et al.
arXiv (All) · Papers · License: Open Access
Open Source ↗Direct PDF ↓
computational-complexitylogic-in-computer-science
computational complexity, formal languages and automata theory, logic in computer science, f.1.1; f.2.2
This document is indexed with metadata only — full text is not available in the archive for this record. Open the official source ↗
Record · ID 798393
Retrieved via Conceptio — every document is proof-bundled with source, license, and retrieval metadata.