Satisfiability problems and algebras of Boolean constraint system games
From MaRDI portal
Cites work
- A combinatorial approach to nonlocality and contextuality
- A positivstellensatz for non-commutative polynomials
- A synchronous game for binary constraint systems
- About the Connes embedding conjecture
- Algebras, synchronous games, and chromatic numbers of graphs
- Characterization of binary constraint system games
- Connes' embedding conjecture and sums of Hermitian squares
- Curious properties of free hypergraph \(C^*\)-algebras
- Entanglement in non-local games and the hyperlinear profile of groups
- Estimating quantum chromatic numbers
- Generalized satisfiability problems via operator assignments
- Introduction to sofic and hyperlinear groups and Connes' embedding conjecture. With an appendix by Vladimir Pestov
- Nonlocal games, compression theorems, and the arithmetical hierarchy
- On the quantum chromatic number of a graph
- Perfect commuting-operator strategies for linear system games
- Perfect strategies for non-local games
- Simple unified form for the major no-hidden-variables theorems
- Synchronous linear constraint system games
- The complexity of satisfiability problems
- The set of quantum correlations is not closed
- Tsirelson's problem and an embedding theorem for groups arising from non-local games
This page was built for publication: Satisfiability problems and algebras of Boolean constraint system games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6977188)
