Polynomial

Results: 3445



#Item
41PRIME SPECIALIZATION IN HIGHER GENUS I BRIAN CONRAD AND KEITH CONRAD Abstract. A classical conjecture predicts how often a polynomial in Z[T ] takes prime values. The natural analogous conjecture for prime values of a po

PRIME SPECIALIZATION IN HIGHER GENUS I BRIAN CONRAD AND KEITH CONRAD Abstract. A classical conjecture predicts how often a polynomial in Z[T ] takes prime values. The natural analogous conjecture for prime values of a po

Add to Reading List

Source URL: math.stanford.edu

Language: English - Date: 2007-08-09 18:48:37
    42Scientific Program* Sections in Mathematics Algebra and Number Theory Organizers: Kerope Chakaryan, Luchezar Avramov, Doichin Tolev V. Drensky. Coordinates and automorphisms of polynomial and free associative

    Scientific Program* Sections in Mathematics Algebra and Number Theory Organizers: Kerope Chakaryan, Luchezar Avramov, Doichin Tolev V. Drensky. Coordinates and automorphisms of polynomial and free associative

    Add to Reading List

    Source URL: www.math.bas.bg

    Language: English - Date: 2013-05-16 09:20:53
      43The G¨odel Prize 2010 Laudatio for S. Arora and J.S.B. Mitchell The G¨odel Prize 2010 is awarded to Sanjeev Arora and Joseph S.B. Mitchell for their concurrent discovery of a polynomial-time approximation scheme (PTAS)

      The G¨odel Prize 2010 Laudatio for S. Arora and J.S.B. Mitchell The G¨odel Prize 2010 is awarded to Sanjeev Arora and Joseph S.B. Mitchell for their concurrent discovery of a polynomial-time approximation scheme (PTAS)

      Add to Reading List

      Source URL: eatcs.org

      Language: English - Date: 2016-09-14 05:18:24
        44SUMS OF SQUARES, MOMENT MATRICES AND OPTIMIZATION OVER POLYNOMIALS MONIQUE LAURENT∗ Updated version: February 6, 2010 Abstract. We consider the problem of minimizing a polynomial over a semialgebraic set defined by pol

        SUMS OF SQUARES, MOMENT MATRICES AND OPTIMIZATION OVER POLYNOMIALS MONIQUE LAURENT∗ Updated version: February 6, 2010 Abstract. We consider the problem of minimizing a polynomial over a semialgebraic set defined by pol

        Add to Reading List

        Source URL: homepages.cwi.nl

        Language: English - Date: 2010-02-06 15:22:54
          45Towards Polynomial Simplex-Like Algorithms for Market Equilibria Jugal Garg∗ Ruta Mehta† Milind Sohoni‡

          Towards Polynomial Simplex-Like Algorithms for Market Equilibria Jugal Garg∗ Ruta Mehta† Milind Sohoni‡

          Add to Reading List

          Source URL: jugal.ise.illinois.edu

          Language: English - Date: 2016-08-01 22:39:11
            46Name Unit 3 – 5.1, Polynomial Functions Review 1. 2.

            Name Unit 3 – 5.1, Polynomial Functions Review 1. 2.

            Add to Reading List

            Source URL: isite.lps.org

            Language: English - Date: 2017-04-12 11:52:27
              47The Approach of Moments for Polynomial Equations Monique Laurent1 and Philipp Rostalski2 1 2

              The Approach of Moments for Polynomial Equations Monique Laurent1 and Philipp Rostalski2 1 2

              Add to Reading List

              Source URL: homepages.cwi.nl

              Language: English - Date: 2010-10-08 01:02:50
                48Polynomial Identity Testing and Circuit Lower Bounds ˇ palek, CWI Robert S based on papers by Nisan & Wigderson, 1994

                Polynomial Identity Testing and Circuit Lower Bounds ˇ palek, CWI Robert S based on papers by Nisan & Wigderson, 1994

                Add to Reading List

                Source URL: www.ucw.cz

                Language: English - Date: 2005-12-04 16:51:26
                  49Doubly Nonnegative Relaxations for Quadratic and Polynomial Optimization Problems with Binary and Box Constraints Sunyoung Kim∗, Masakazu Kojima†,

                  Doubly Nonnegative Relaxations for Quadratic and Polynomial Optimization Problems with Binary and Box Constraints Sunyoung Kim∗, Masakazu Kojima†,

                  Add to Reading List

                  Source URL: www.optimization-online.org

                  Language: English - Date: 2017-12-06 01:54:04
                    50Efficient Inference of Continuous Markov Random Fields with Polynomial Potentials Shenlong Wang University of Toronto

                    Efficient Inference of Continuous Markov Random Fields with Polynomial Potentials Shenlong Wang University of Toronto

                    Add to Reading List

                    Source URL: papers.nips.cc

                    Language: English - Date: 2014-12-02 19:01:58