The expressibility of functions on the boolean domain, with applications to counting CSPs (Q5395728): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3125322785 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1108.5288 / rank | |||
Normal rank | |||
Latest revision as of 02:49, 20 April 2024
scientific article; zbMATH DE number 6258126
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The expressibility of functions on the boolean domain, with applications to counting CSPs |
scientific article; zbMATH DE number 6258126 |
Statements
The expressibility of functions on the boolean domain, with applications to counting CSPs (English)
0 references
17 February 2014
0 references
approximation algorithms
0 references
computational complexity
0 references
constraint satisfaction problems
0 references
counting problems
0 references
