On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism (Q3602912)
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 complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism |
scientific article; zbMATH DE number 5507865
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism |
scientific article; zbMATH DE number 5507865 |
Statements
On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism (English)
0 references
12 February 2009
0 references
0.9894630312919616
0 references
0.8358426690101624
0 references
0.7412192821502686
0 references
0.7394830584526062
0 references
0.7379641532897949
0 references
