Polynomial-time solvable \(\#\)CSP problems via algebraic models and Pfaffian circuits (Q898252): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
m rollbackEdits.php mass rollback Tag: Rollback |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2171050449 / rank | |||
Revision as of 22:46, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial-time solvable \(\#\)CSP problems via algebraic models and Pfaffian circuits |
scientific article |
Statements
Polynomial-time solvable \(\#\)CSP problems via algebraic models and Pfaffian circuits (English)
0 references
8 December 2015
0 references
dichotomy theorems
0 references
Gröbner bases
0 references
computer algebra
0 references
\(\#\)CSP
0 references
polynomial ideals
0 references
