Fast parallel constraint satisfaction (Q4630280)
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: Fast parallel constraint satisfaction |
scientific article; zbMATH DE number 7045132
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast parallel constraint satisfaction |
scientific article; zbMATH DE number 7045132 |
Statements
Fast parallel constraint satisfaction (English)
0 references
29 March 2019
0 references
bipartite graph
0 references
parallel algorithm
0 references
line drawing
0 references
constraint satisfaction problem
0 references
transitive closure
0 references
0 references
0.9864212274551392
0 references
0.857316792011261
0 references
0.8188689947128296
0 references