arXiv (All)
open access
Network Satisfaction over Four-Atom Relation Algebras: Complexity and Representations
Andréka and Maddux classified the relation algebras with at most 3 atoms, and in particular they showed that all of them are representable. Cristani and Hirsch showed that the network satisfaction problem (NSP) for each of these algebras is in P or NP-complete. The literature contains many results o
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
- Relational Existence Theory for Chemical Reaction Networks: A New Framework for Dynamic Interaction Models#77363
- Flexible Qubit Allocation of Network Resource States#1076761
- Understanding Color Confinement through Quantum Reference Frames and Relational Observables#1200987
- Is the Quantum-Entangled Universe a Small World?#1048782
- Postscript: Univocity of Intuitionistic and Classical Connectives#80740
Record · ID 1200768
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