ConceptioArchivearXiv (All)
arXiv (All)open access

NEXP-Completeness of Existential Presburger Arithmetic with Divisibility

Barros, Ignacio et al.
arXiv (All) · Papers · License: Open Access
Open Source ↗Direct PDF ↓
computational-complexitylogic-in-computer-science
logic in computer science, computational complexity
This document is indexed with metadata only — full text is not available in the archive for this record. Open the official source ↗
Record · ID 1034192
Retrieved via Conceptio — every document is proof-bundled with source, license, and retrieval metadata.