Polytope

Results: 250



#Item
31arXiv:1311.2369v1 [cs.CC] 11 NovThe matching polytope has exponential extension complexity Thomas Rothvoß∗ Massachusetts Institute of Technology

arXiv:1311.2369v1 [cs.CC] 11 NovThe matching polytope has exponential extension complexity Thomas Rothvoß∗ Massachusetts Institute of Technology

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2013-11-11 20:28:47
    32Explicit 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 ∗

    Add to Reading List

    Source URL: www.math.lsa.umich.edu

    Language: English - Date: 2012-04-19 13:31:46
    33Econometrica, 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

    Add to Reading List

    Source URL: www.maths.lse.ac.uk

    Language: English - Date: 2006-03-03 11:56:34
    34Discrete Comput Geom 21:557–Discrete & Computational Geometry

    Discrete Comput Geom 21:557–Discrete & Computational Geometry

    Add to Reading List

    Source URL: www.maths.lse.ac.uk

    Language: English
    35CENTRALLY SYMMETRIC POLYTOPES WITH MANY FACES Alexander Barvinok, Seung Jin Lee, and Isabella Novik November 2011 Abstract. We present explicit constructions of centrally symmetric polytopes with many faces: (1) we cons

    CENTRALLY SYMMETRIC POLYTOPES WITH MANY FACES Alexander Barvinok, Seung Jin Lee, and Isabella Novik November 2011 Abstract. We present explicit constructions of centrally symmetric polytopes with many faces: (1) we cons

    Add to Reading List

    Source URL: www.math.lsa.umich.edu

    Language: English - Date: 2011-11-18 11:46:14
    36On n-Dimensional Polytope Schemes David F. Fouhey Daniel Maturana Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, PA, USA 15213

    On n-Dimensional Polytope Schemes David F. Fouhey Daniel Maturana Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, PA, USA 15213

    Add to Reading List

    Source URL: oneweirdkerneltrick.com

    Language: English - Date: 2013-04-01 17:43:09
      37MODESTO: Data-centric Analytic Optimization of Complex Stencil Programs on Heterogeneous Architectures Tobias Gysi Tobias Grosser

      MODESTO: Data-centric Analytic Optimization of Complex Stencil Programs on Heterogeneous Architectures Tobias Gysi Tobias Grosser

      Add to Reading List

      Source URL: spcl.inf.ethz.ch

      Language: English - Date: 2015-05-07 10:55:30
      38Now: A Spectral Approach to Ghost Detection Next: On n-Dimensional Polytope Schemes and a special message from our sponsors A Spectral Approach to Ghost Detection

      Now: A Spectral Approach to Ghost Detection Next: On n-Dimensional Polytope Schemes and a special message from our sponsors A Spectral Approach to Ghost Detection

      Add to Reading List

      Source URL: www.oneweirdkerneltrick.com

      Language: English - Date: 2013-04-05 02:58:43
        39MODESTO: Data-centric Analytic Optimization of Complex Stencil Programs on Heterogeneous Architectures Tobias Gysi Tobias Grosser

        MODESTO: Data-centric Analytic Optimization of Complex Stencil Programs on Heterogeneous Architectures Tobias Gysi Tobias Grosser

        Add to Reading List

        Source URL: htor.inf.ethz.ch

        Language: English - Date: 2015-05-20 10:03:50