Complexity analysis of propositional concurrent programs using domino tiling (Q3142002)
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: Complexity analysis of propositional concurrent programs using domino tiling |
scientific article; zbMATH DE number 440096
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity analysis of propositional concurrent programs using domino tiling |
scientific article; zbMATH DE number 440096 |
Statements
Complexity analysis of propositional concurrent programs using domino tiling (English)
0 references
6 December 1993
0 references
concurrency
0 references
rendevouz
0 references
CSP
0 references
tiling problems
0 references
complexity classes
0 references
0.8154246211051941
0 references
0.7692188620567322
0 references
0.7657551169395447
0 references
0.750878095626831
0 references
