The expressibility of functions on the boolean domain, with applications to counting CSPs (Q5395728): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q56323823, #quickstatements; #temporary_batch_1708298810402 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56323823 / rank | |||
Normal rank | |||
Revision as of 01:38, 19 February 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
