Politopo convexo (Spanish Wikipedia)

Analysis of information sources in references of the Wikipedia article "Politopo convexo" in Spanish language version.

refsWebsite

Global rank Spanish rank

2^nd place

451^st place

1,294^th place

3^rd place

7^th place

26^th place

56^th place

1^st place

69^th place

148^th place

low place

ams.org

Blind, Roswitha; Mani-Levitska, Peter (1987), «Puzzles and polytope isomorphisms», Aequationes Mathematicae 34 (2-3): 287-297, MR 921106, doi:10.1007/BF01830678 ..
Kalai, Gil (1988), «A simple way to tell a simple polytope from its graph», Journal of Combinatorial Theory, Ser. A 49 (2): 381-383, MR 964396, doi:10.1016/0097-3165(88)90064-7 ..
Yao, Andrew Chi Chih (1981), «A lower bound to finding convex hulls», Journal of the ACM 28 (4): 780-787, MR 677089, doi:10.1145/322276.322289 .; Ben-Or, Michael (1983), «Lower Bounds for Algebraic Computation Trees», Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing (STOC '83), pp. 80-86, doi:10.1145/800061.808735 ..

Whitney, Hassler (1932). «Congruent graphs and the connectivity of graphs». Amer. J. Math. 54 (1): 150-168. JSTOR 2371086. doi:10.2307/2371086.
Blind, Roswitha; Mani-Levitska, Peter (1987), «Puzzles and polytope isomorphisms», Aequationes Mathematicae 34 (2-3): 287-297, MR 921106, doi:10.1007/BF01830678 ..
Kalai, Gil (1988), «A simple way to tell a simple polytope from its graph», Journal of Combinatorial Theory, Ser. A 49 (2): 381-383, MR 964396, doi:10.1016/0097-3165(88)90064-7 ..
Kaibel, Volker; Schwartz, Alexander (2003). «On the Complexity of Polytope Isomorphism Problems». Graphs and Combinatorics 19 (2): 215-230. arXiv:math/0106093. doi:10.1007/s00373-002-0503-y. Archivado desde el original el 21 de julio de 2015.
Büeler, B.; Enge, A.; Fukuda, K. (2000). «Exact Volume Computation for Polytopes: A Practical Study». Polytopes — Combinatorics and Computation. p. 131. ISBN 978-3-7643-6351-2. doi:10.1007/978-3-0348-8438-9_6.
Yao, Andrew Chi Chih (1981), «A lower bound to finding convex hulls», Journal of the ACM 28 (4): 780-787, MR 677089, doi:10.1145/322276.322289 .; Ben-Or, Michael (1983), «Lower Bounds for Algebraic Computation Trees», Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing (STOC '83), pp. 80-86, doi:10.1145/800061.808735 ..

Whitney, Hassler (1932). «Congruent graphs and the connectivity of graphs». Amer. J. Math. 54 (1): 150-168. JSTOR 2371086. doi:10.2307/2371086.