✦ LIBER ✦

On the Complexity of Polytope Isomorphism Problems

✍ Scribed by Volker Kaibel; Alexander Schwartz

Publisher: Springer Japan
Year: 2003
Tongue: English
Weight: 222 KB
Volume: 19
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-002-0503-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Complexity of Matroid Isomorphism

On the Complexity of Matroid Isomorphism Problem

✍ B. V. Raghavendra Rao; M. N. Jayalal Sarma 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 841 KB

Approximation problems for combinatorial

Approximation problems for combinatorial isomorphism classes of convex polytopes

✍ Magelone Kömhoff; G. C. Shephard 📂 Article 📅 1974 🏛 Springer 🌐 English ⚖ 780 KB

ISOMORPHISM CLASSES OF CONVEX POLYTOPES ## 1. Introduction Let ~a denote the set of all d-dimensional convex polytopes (d-polytopes) in d-dimensional Euclidean space R d. For any Pe~ a we write [P] for the class of all d-polytopes combinatorially isomorphic to P. For the definitions of these terms

On the complexity of computing the diame

On the complexity of computing the diameter of a polytope

✍ Alan M. Frieze; Shang-Hua Teng 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 585 KB

Complexity of “wild” matrix problems and

Complexity of “wild” matrix problems and of isomorphism of algebras and graphs

✍ D. Yu. Grigor'ev 📂 Article 📅 1983 🏛 Springer US 🌐 English ⚖ 425 KB

On the Complexity of the Isomorphism Rel

On the Complexity of the Isomorphism Relation for Finitely Generated Groups

✍ Simon Thomas; Boban Velickovic 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 158 KB

On the LpMinkowski Problem for Polytopes

✍ Daniel Hug; Erwin Lutwak; Deane Yang; Gaoyong Zhang 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 238 KB