On the computational complexity of detecting possibilistic locality (Q4684357)
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: On the computational complexity of detecting possibilistic locality |
scientific article; zbMATH DE number 6945513
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational complexity of detecting possibilistic locality |
scientific article; zbMATH DE number 6945513 |
Statements
On the computational complexity of detecting possibilistic locality (English)
0 references
28 September 2018
0 references
