arXiv (All)
open access
Maltsev Constraint Satisfaction Problems and Deterministic Logspace With Counting
In this article, we prove that the problem of solving $\operatorname{CSP}(\mathbf{A})$, where $\mathbf{A}$ is a finite relational template which admits a Maltsev polymorphism is in a specific complexity class DET, which is related to the complexity of computing the determinant of a matrix with integ
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On (n,k)-Simple Random Integer Lattices.#315711
- UTVPI-representable integer point sets: discrete convexity, polymorphisms, and pairwise closure#1035599
- Regularized Coupling Maps on Matrix Polytopes: From Assignment to Graph Matching and Optimal Transport#794105
- Regularized Coupling Maps on Matrix Polytopes: From Assignment to Graph Matching and Optimal Transport#790086
- On integral polytopes related to Edmonds' problem#1014291
Record · ID 1105316
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive