Complexity Results for POMSET Languages (Q3136615)
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 Results for POMSET Languages |
scientific article; zbMATH DE number 425597
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity Results for POMSET Languages |
scientific article; zbMATH DE number 425597 |
Statements
Complexity Results for POMSET Languages (English)
0 references
14 October 1993
0 references
pomset language
0 references
\(\Pi^ P_ 2\)-complete
0 references
pomset
0 references
concurrent system
0 references
membership
0 references
NP-complete
0 references
containment
0 references
equality
0 references
graph-isomorphism
0 references
0.7616125345230103
0 references
0.7526394128799438
0 references
0.7526394128799438
0 references
0.75169438123703
0 references
