arXiv (All)
open access
Existence and nonexistence of commutativity gadgets for entangled CSPs
Commutativity gadgets allow NP-hardness proofs for classical constraint satisfaction problems (CSPs) to be carried over to undecidability proofs for the corresponding entangled CSPs. This has been done, for instance, for NP-complete boolean CSPs and 3-colouring in the work of Culf and Mastel. For ma
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
- G_q-concurrence and entanglement constraints in multiqubit systems#1062745
- Quantum algorithms for equational reasoning.#193672
- Nmatrices cuánticas, cuasiconjuntos y el teorema de Kochen-Specker#102429
- The Decision Problem for Entanglement#755828
- Lógica cuántica, Nmatrices y adecuación, II#100697
Record · ID 1062636
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