arXiv (OAI Expanded)
open access
Conservative CSPs in Logspace are in Symmetric Linear Datalog (under complexity theoretic assumptions)
We show that the constraint satisfaction problem of any finite conservative structure that can not pp-construct st-Con (whose CSP is NL-complete) or 3Lin2 (whose CSP is Mod2L-complete) is solved by a symmetric linear Datalog program and therefore in L.
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
- Learning Context-Free Grammars for Grammar-Constrained Decoding via Declarative Agentic Programming with Guarantees#432608
- Predicting Student Attrition in Competitive Programming: A Large-Scale Study Integrating Survey Insights and Global Behavioral Logs#792869
- Predicting Student Attrition in Competitive Programming: A Large-Scale Study Integrating Survey Insights and Global Behavioral Logs#788865
- Interior-point proximal methods for nonsmooth optimization in Hilbert spaces with cone-ordered constraints#1083310
- RuBench: A Repository-Level Agentic Coding Benchmark with Natively Authored Russian Task Specifications#346553
Record · ID 1319183
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