Classical vs. quantum satisfiability in linear constraint systems modulo an integer (Q6329853)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Classical vs. quantum satisfiability in linear constraint systems modulo an integer |
scientific article; zbMATH DE number 7644776
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Classical vs. quantum satisfiability in linear constraint systems modulo an integer |
scientific article; zbMATH DE number 7644776 |
Statements
25 November 2019
0 references
quant-ph
0 references
math-ph
0 references
math.MP
0 references
