arXiv (OAI Expanded)
open access
Graph Homomorphisms and Universal Algebra
Constraint satisfaction problems are computational problems that naturally appear in many areas of theoretical computer science. One of the central themes is their computational complexity, and in particular the border between polynomial-time tractability and NP-hardness. In this course we introduce
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
- A Knowledge Compilation Take on Binary Polynomial Optimization#326074
- Edge complexity of weighted graphs: involutory symmetries and NP-hardness#1050034
- A complete classification of metrizable and strictly metrizable theta graphs#987710
- Tiga: Compiling Graph Message Passing at Scale#1051203
- Tiga: Compiling Graph Message Passing at Scale#1028649
Record · ID 1109003
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