arXiv (All)open access
NEXP-Completeness of Existential Presburger Arithmetic with Divisibility
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.