Pages that link to "Item:Q1401558"
From MaRDI portal
The following pages link to On the complexity of polytope isomorphism problems (Q1401558):
Displaying 18 items.
- The complete enumeration of 4-polytopes and 3-spheres with nine vertices (Q161299) (← links)
- Applications of dimensionality reduction and exponential sums to graph automorphism (Q551192) (← links)
- Drawing polytopal graphs with {\texttt{polymake}} (Q600948) (← links)
- Finding a simple polytope from its graph in polynomial time (Q1017924) (← links)
- Two graph isomorphism polytopes (Q1043653) (← links)
- Puzzles and polytope isomorphisms (Q1096888) (← links)
- The complexity of Boolean matrix root computation (Q1884841) (← links)
- Algorithms for highly symmetric linear and integer programs (Q1942261) (← links)
- Self-duality of polytopes and its relations to vertex enumeration and graph isomorphism (Q2014726) (← links)
- Exploiting Symmetries in Polyhedral Computations (Q2849003) (← links)
- On the Complexity of Matroid Isomorphism Problems (Q3392964) (← links)
- Classification of eight-dimensional perfect forms (Q3432119) (← links)
- The Structure of Level-k Phylogenetic Networks (Q3637120) (← links)
- (Q3796984) (← links)
- (Q4247795) (← links)
- (Q4598229) (← links)
- Isomorphisms of maps on the sphere (Q4998745) (← links)
- Embedding divisor and semi-prime testability in \(f\)-vectors of polytopes (Q6098115) (← links)
