Polynomial-time solvable \(\#\)CSP problems via algebraic models and Pfaffian circuits (Q898252)
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: Polynomial-time solvable \#CSP problems via algebraic models and Pfaffian circuits |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
0 references
0.8268783092498779
0 references
0.7746508717536926
0 references
0.7481768131256104
0 references
0.7462234497070312
0 references
