Polynomials

Results: 2265



#Item
81On the CRT method to compute class polynomials in genus 2 Réunion CHIC Kristin Lauter1 , Damien Robert1 1

On the CRT method to compute class polynomials in genus 2 Réunion CHIC Kristin Lauter1 , Damien Robert1 1

Add to Reading List

Source URL: www.normalesup.org

- Date: 2014-08-03 16:15:38
    82Structured FFT and TFT: symmetric and lattice polynomials∗ Joris van der Hoeven Romain Lebreton

    Structured FFT and TFT: symmetric and lattice polynomials∗ Joris van der Hoeven Romain Lebreton

    Add to Reading List

    Source URL: www.csd.uwo.ca

    - Date: 2014-04-26 00:12:04
      83Project 1: Part 2 Here we continue the preliminary project. Calculus on Polynomials There’s a certain pattern in defining many generic functions: (define-generic (do-something (f)) ;; define it for appropriate non-Mero

      Project 1: Part 2 Here we continue the preliminary project. Calculus on Polynomials There’s a certain pattern in defining many generic functions: (define-generic (do-something (f)) ;; define it for appropriate non-Mero

      Add to Reading List

      Source URL: www.math.purdue.edu

      - Date: 2014-02-18 12:25:03
        84APPENDIX: E-POLYNOMIALS, ZETA-EQUIVALENCE, AND POLYNOMIAL-COUNT VARIETIES NICHOLAS M. KATZ Given a noetherian ring R, we denote by (Sch/R) the category of separated Rschemes of finite type, morphisms being the R-morphism

        APPENDIX: E-POLYNOMIALS, ZETA-EQUIVALENCE, AND POLYNOMIAL-COUNT VARIETIES NICHOLAS M. KATZ Given a noetherian ring R, we denote by (Sch/R) the category of separated Rschemes of finite type, morphisms being the R-morphism

        Add to Reading List

        Source URL: web.math.princeton.edu

        - Date: 2006-12-14 17:16:17
          85Asymptotically Optimal Hitting Sets Against Polynomials Markus Bl¨ aser1 , Moritz Hardt2 , and David Steurer2 1

          Asymptotically Optimal Hitting Sets Against Polynomials Markus Bl¨ aser1 , Moritz Hardt2 , and David Steurer2 1

          Add to Reading List

          Source URL: www-cc.cs.uni-saarland.de

          - Date: 2012-05-16 12:03:10
            86Sudoku Squares and Chromatic Polynomials Agnes M. Herzberg and M. Ram Murty T

            Sudoku Squares and Chromatic Polynomials Agnes M. Herzberg and M. Ram Murty T

            Add to Reading List

            Source URL: www.mast.queensu.ca

            - Date: 2007-04-18 12:13:05
              87THE STATISTICAL DISTRIBUTION OF THE ZEROS OF RANDOM PARAORTHOGONAL POLYNOMIALS ON THE UNIT CIRCLE MIHAI STOICIU Abstract. We consider polynomials on the unit circle defined by the recurrence relation

              THE STATISTICAL DISTRIBUTION OF THE ZEROS OF RANDOM PARAORTHOGONAL POLYNOMIALS ON THE UNIT CIRCLE MIHAI STOICIU Abstract. We consider polynomials on the unit circle defined by the recurrence relation

              Add to Reading List

              Source URL: sites.williams.edu

              - Date: 2012-08-22 10:38:23
                88Fast Conversion Algorithms for Orthogonal Polynomials Alin Bostan Bruno Salvy

                Fast Conversion Algorithms for Orthogonal Polynomials Alin Bostan Bruno Salvy

                Add to Reading List

                Source URL: www.csd.uwo.ca

                - Date: 2008-12-16 23:32:48
                  89Fast arithmetic for polynomials and matrices in Mathemagix by Grégoire Lecerf Université de Versailles & CNRS France

                  Fast arithmetic for polynomials and matrices in Mathemagix by Grégoire Lecerf Université de Versailles & CNRS France

                  Add to Reading List

                  Source URL: www.saga-network.eu

                  - Date: 2010-04-02 08:38:52
                    90Periodic Integer-Valued Polynomials and the Combinatorial Nullstellensatz Uwe Schauz Xi’an Jiaotong-Liverpool University, Suzhou, China

                    Periodic Integer-Valued Polynomials and the Combinatorial Nullstellensatz Uwe Schauz Xi’an Jiaotong-Liverpool University, Suzhou, China

                    Add to Reading List

                    Source URL: www.math.uni-magdeburg.de

                    - Date: 2013-08-06 10:51:19