On Searching for Small Kochen-Specker Vector Systems
DOI10.1007/978-3-642-25870-1_4zbMath1341.05162arXiv1111.3301MaRDI QIDQ3104762
Felix Arends, Joël Ouaknine, Charles W. Wampler
Publication date: 16 December 2011
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1111.3301
constraint solving; graph enumeration algorithms; Kochen-Specker vector systems; topological graph embedding problems
81P05: General and philosophical questions in quantum theory
81P68: Quantum computation
05C30: Enumeration in graph theory
05C85: Graph algorithms (graph-theoretic aspects)
05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The free will theorem
- On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
- On Searching for Small Kochen-Specker Vector Systems
- Orderly algorithms for graph generation
- Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
- Isomorph-Free Exhaustive Generation
- Kochen–Specker vectors
- Two simple proofs of the Kochen-Specker theorem
- Quantum theory: concepts and methods
- Algorithms in real algebraic geometry