Polynomial

Results: 3445



#Item
581

Comparing universal covers in polynomial time Jiˇr´ı Fiala1 and Dani¨el Paulusma2 1 Charles University, Faculty of Mathematics and Physics, DIMATIA and Institute for Theoretical Computer Science (ITI)

Add to Reading List

Source URL: iti.mff.cuni.cz

Language: English - Date: 2016-02-04 05:53:37
    582

    S´eminaire BOURBAKI 64`eme ann´ee, , no 1054 MarsARITHMETIC AND POLYNOMIAL PROGRESSIONS

    Add to Reading List

    Source URL: www.juliawolf.org

    Language: English - Date: 2012-10-17 04:27:40
      583

      arXiv:math/0610050v1 [math.NT] 1 OctTHE PRIMES CONTAIN ARBITRARILY LONG POLYNOMIAL PROGRESSIONS TERENCE TAO AND TAMAR ZIEGLER

      Add to Reading List

      Source URL: arxiv.org

      Language: English - Date: 2014-01-25 03:05:14
        584Mathematical analysis / Mathematics / Symbol / Probability distributions / Diophantine approximation / Generalised Whitehead product / Shifting nth root algorithm

        On the Complexity of Solving a Bivariate Polynomial System Pavel Emeliyanenko Michael Sagraloff

        Add to Reading List

        Source URL: people.mpi-inf.mpg.de

        Language: English - Date: 2012-01-20 07:19:27
        585

        LOWER BOUNDS FOR A POLYNOMIAL IN TERMS OF ITS COEFFICIENTS MEHDI GHASEMI AND MURRAY MARSHALL Abstract. Recently Lasserre [6] gave a sufficient condition in terms of the coefficients for a polynomial f ∈ R[X] of degree

        Add to Reading List

        Source URL: math.usask.ca

        Language: English - Date: 2009-12-17 10:11:56
          586

          Polynomial actions of unitary operators and idempotent ultrafilters Mariusz Lemańczyk (based on a joint work with Vitaly Bergelson and Stanisław Kasjan) UMK Toruń

          Add to Reading List

          Source URL: fourier.math.uoc.gr

          Language: English - Date: 2013-06-06 05:00:18
            587

            LOWER BOUNDS ON THE GLOBAL MINIMUM OF A POLYNOMIAL M. GHASEMI, J.B. LASSERRE, M. MARSHALL Abstract. We extend the method of Ghasemi and Marshall [SIAM. J. Opt), pp], to obtain a lower bound fgp,M for

            Add to Reading List

            Source URL: math.usask.ca

            Language: English - Date: 2013-07-04 16:27:26
              588

              A Polynomial-time Nash Equilibrium Algorithm for Repeated Stochastic Games Enrique Munoz de Cote∗ DEI, Politecnico di Milano piazza Leonardo da Vinci, 32

              Add to Reading List

              Source URL: uai2008.cs.helsinki.fi

              Language: English - Date: 2008-05-16 11:12:17
                589

                Markov operators, classical orthogonal polynomial ensembles, and random matrices M. Ledoux, Institut de Math´ematiques de Toulouse, France 5ecm Amsterdam, July 2008

                Add to Reading List

                Source URL: perso.math.univ-toulouse.fr

                Language: English - Date: 2015-07-09 05:58:09
                  590Mathematics / Mathematical analysis / Geometry / Group theory / Analytic number theory / Elliptic curve / Polynomial / Prime number / Curve / Pi

                  Introduction The CRT method Examples and Results

                  Add to Reading List

                  Source URL: www.hyperelliptic.org

                  Language: English - Date: 2008-10-03 22:36:32
                  UPDATE