ConceptioArchivearXiv (All)
arXiv (All)open access

Contextual Fraction Beyond Satisfiability: Pure NAE Completeness, Exact Orbit Packings, and Width Barriers

Katende, Ronald
arXiv (All) · Papers · License: Open Access
Open Source ↗Direct PDF ↓
computational-complexitydiscrete-mathematics
computational complexity, discrete mathematics
This document is indexed with metadata only — full text is not available in the archive for this record. Open the official source ↗
Record · ID 1034049
Retrieved via Conceptio — every document is proof-bundled with source, license, and retrieval metadata.