On the complexity of diagram testing (Q1319079)
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 549269
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of diagram testing |
scientific article; zbMATH DE number 549269 |
Statements
On the complexity of diagram testing (English)
0 references
15 March 1995
0 references
orientation
0 references
NP-completeness
0 references
finite poset
0 references
diagram
0 references
0.7427546381950378
0 references
0.7361040711402893
0 references
0.7348914742469788
0 references
0.7295250296592712
0 references
0.7250300049781799
0 references
