Complexity of Satisfiability in Kochen-Specker Partial Boolean Algebras

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Dawar, Anuj, Shah, Nihil
Format:	Preprint
Published:	2026
Subjects:	Quantum Physics Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2602.24164