1![A C 1 Cross Polytope Macro-element in Four Variables Tatyana Sorokina Abstract. A C 1 macro-element in four variables is constructed based on a split of a cross polytope into sixteen simplices. The element uses A C 1 Cross Polytope Macro-element in Four Variables Tatyana Sorokina Abstract. A C 1 macro-element in four variables is constructed based on a split of a cross polytope into sixteen simplices. The element uses](https://www.pdfsearch.io/img/264e997dad75ed37ecad64465ceddb3d.jpg) | Add to Reading ListSource URL: www.math.utah.edu- Date: 2006-08-21 17:18:34
|
---|
2![SUM OF SQUARES CERTIFICATES FOR CONTAINMENT OF H-POLYTOPES IN V-POLYTOPES KAI KELLNER AND THORSTEN THEOBALD Abstract. Given an H-polytope P and a V-polytope Q, the decision problem whether P is contained in Q is co-NP-co SUM OF SQUARES CERTIFICATES FOR CONTAINMENT OF H-POLYTOPES IN V-POLYTOPES KAI KELLNER AND THORSTEN THEOBALD Abstract. Given an H-polytope P and a V-polytope Q, the decision problem whether P is contained in Q is co-NP-co](https://www.pdfsearch.io/img/2362356c618e58938ac15c9b2728995a.jpg) | Add to Reading ListSource URL: www.math.uni-frankfurt.de- Date: 2016-02-20 10:25:47
|
---|
3![CONTAINMENT PROBLEMS FOR POLYTOPES AND SPECTRAHEDRA KAI KELLNER, THORSTEN THEOBALD, AND CHRISTIAN TRABANDT Abstract. We study the computational question whether a given polytope or spectrahedron SA (as given by the posit CONTAINMENT PROBLEMS FOR POLYTOPES AND SPECTRAHEDRA KAI KELLNER, THORSTEN THEOBALD, AND CHRISTIAN TRABANDT Abstract. We study the computational question whether a given polytope or spectrahedron SA (as given by the posit](https://www.pdfsearch.io/img/e9b3e2703ba1ea7c2edcb2b7aeb3626f.jpg) | Add to Reading ListSource URL: www.math.uni-frankfurt.de- Date: 2013-07-03 15:46:35
|
---|
4![Fooling-sets and Rank in Nonzero Characteristic Dirk Oliver Theis University of Tartu Estonia Fooling-sets and Rank in Nonzero Characteristic Dirk Oliver Theis University of Tartu Estonia](https://www.pdfsearch.io/img/0ed9de4bda5425e38b3914d45b53ff27.jpg) | Add to Reading ListSource URL: www.math.uni-magdeburg.deLanguage: English - Date: 2013-08-30 09:23:22
|
---|
5![A BOUND FOR THE NUMBER OF VERTICES OF A POLYTOPE WITH APPLICATIONS Alexander Barvinok April 2012 Abstract. We prove that the number of vertices of a polytope of a particular kind A BOUND FOR THE NUMBER OF VERTICES OF A POLYTOPE WITH APPLICATIONS Alexander Barvinok April 2012 Abstract. We prove that the number of vertices of a polytope of a particular kind](https://www.pdfsearch.io/img/af5439949ea770b9e1386111d6014146.jpg) | Add to Reading ListSource URL: www.math.lsa.umich.eduLanguage: English - Date: 2012-04-23 12:14:14
|
---|
6![New Lower Bounds for the Number of Equilibria in Bimatrix Games Bernhard von Stengel ∗ ETH Z¨ urich New Lower Bounds for the Number of Equilibria in Bimatrix Games Bernhard von Stengel ∗ ETH Z¨ urich](https://www.pdfsearch.io/img/040fe23e276f6af2022a534631768af0.jpg) | Add to Reading ListSource URL: www.maths.lse.ac.ukLanguage: English - Date: 2015-07-28 05:00:07
|
---|
7![HOW NEIGHBORLY CAN A CENTRALLY SYMMETRIC POLYTOPE BE? NATHAN LINIAL AND ISABELLA NOVIK Abstract. We show that there exist k-neighborly centrally symmetric ddimensional polytopes with 2(n + d) vertices, where „ HOW NEIGHBORLY CAN A CENTRALLY SYMMETRIC POLYTOPE BE? NATHAN LINIAL AND ISABELLA NOVIK Abstract. We show that there exist k-neighborly centrally symmetric ddimensional polytopes with 2(n + d) vertices, where „](https://www.pdfsearch.io/img/b9845f8189ee341185c179772240d651.jpg) | Add to Reading ListSource URL: www.math.washington.eduLanguage: English |
---|
8![Explicit constructions of centrally symmetric k-neighborly polytopes and large strictly antipodal sets Alexander Barvinok ∗ Explicit constructions of centrally symmetric k-neighborly polytopes and large strictly antipodal sets Alexander Barvinok ∗](https://www.pdfsearch.io/img/e3397dab2d5731aa00bf7747d52a1e28.jpg) | Add to Reading ListSource URL: www.math.lsa.umich.eduLanguage: English - Date: 2012-04-19 13:31:46
|
---|
9![Econometrica, Vol. 74, No. 2 (March, 2006), 397–429 HARD-TO-SOLVE BIMATRIX GAMES BY RAHUL SAVANI AND BERNHARD VON STENGEL1 The Lemke–Howson algorithm is the classical method for finding one Nash equilibrium of a bim Econometrica, Vol. 74, No. 2 (March, 2006), 397–429 HARD-TO-SOLVE BIMATRIX GAMES BY RAHUL SAVANI AND BERNHARD VON STENGEL1 The Lemke–Howson algorithm is the classical method for finding one Nash equilibrium of a bim](https://www.pdfsearch.io/img/448781fd9367a34074773d8cd3ea7196.jpg) | Add to Reading ListSource URL: www.maths.lse.ac.ukLanguage: English - Date: 2006-03-03 11:56:34
|
---|
10![Discrete Comput Geom 21:557–Discrete & Computational Geometry Discrete Comput Geom 21:557–Discrete & Computational Geometry](https://www.pdfsearch.io/img/6a1c39b0345e6823c5541a8ae35a7b3b.jpg) | Add to Reading ListSource URL: www.maths.lse.ac.ukLanguage: English |
---|