Characterizing the multi-pass streaming complexity for solving Boolean CSPs exactly (Q6610352)
From MaRDI portal
!
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 7918401
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Characterizing the multi-pass streaming complexity for solving Boolean CSPs exactly |
scientific article; zbMATH DE number 7918401 |
Statements
Characterizing the multi-pass streaming complexity for solving Boolean CSPs exactly (English)
0 references
25 September 2024
0 references
streaming algorithms
0 references
constraint satisfaction problems
0 references
