Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems (Q3012844)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 5918004
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems |
scientific article; zbMATH DE number 5918004 |
Statements
Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems (English)
0 references
6 July 2011
0 references
0 references
0 references
0.9065842
0 references
0.9065842
0 references
0.8870694
0 references
0.88171303
0 references
0.8781215
0 references
0.8779762
0 references
0.87687516
0 references
0.8697527
0 references
