Multiplication

Results: 2440



#Item
11Q-Curves with Complex Multiplication Ley Wilson A thesis submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Pure Mathematics

Q-Curves with Complex Multiplication Ley Wilson A thesis submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Pure Mathematics

Add to Reading List

Source URL: www.i2m.univ-amu.fr

Language: English - Date: 2014-09-16 07:02:03
    12Classroom Voting Questions: Algebra Section 4.2 Solving Linear Inequalities Using the Multiplication - Division Principle 1. True or False: If −x < 0 then x < 0. (a) True, and I am very confident (b) True, but I am no

    Classroom Voting Questions: Algebra Section 4.2 Solving Linear Inequalities Using the Multiplication - Division Principle 1. True or False: If −x < 0 then x < 0. (a) True, and I am very confident (b) True, but I am no

    Add to Reading List

    Source URL: mathquest.carroll.edu

    - Date: 2018-01-22 07:20:10
      13Exponential Multiplication Schemes Bernd Borchert Klaus Reinhardt WSI

      Exponential Multiplication Schemes Bernd Borchert Klaus Reinhardt WSI

      Add to Reading List

      Source URL: users.informatik.uni-halle.de

      Language: English - Date: 2006-12-21 18:06:50
        14QUATERNION ALGEBRAS KEITH CONRAD 1. Introduction A complex number is a sum a+bi with a, b ∈ R and i2 = −1. Addition and multiplication are given by the rules

        QUATERNION ALGEBRAS KEITH CONRAD 1. Introduction A complex number is a sum a+bi with a, b ∈ R and i2 = −1. Addition and multiplication are given by the rules

        Add to Reading List

        Source URL: www.math.uconn.edu

        Language: English - Date: 2015-05-10 23:36:05
          152018 IEEE International Symposium on High Performance Computer Architecture OuterSPACE: An Outer Product based Sparse Matrix Multiplication Accelerator Subhankar Pal∗ Jonathan Beaumont∗ Dong-Hyeon Park∗ Aporva Ama

          2018 IEEE International Symposium on High Performance Computer Architecture OuterSPACE: An Outer Product based Sparse Matrix Multiplication Accelerator Subhankar Pal∗ Jonathan Beaumont∗ Dong-Hyeon Park∗ Aporva Ama

          Add to Reading List

          Source URL: blaauw.engin.umich.edu

          Language: English - Date: 2018-04-06 13:27:35
            16Complex multiplication and canonical lifts David R. Kohel Abstract The problem of constructing CM invariants of higher dimensional abelian varieties presents significant new challenges relative to CM constructions in dim

            Complex multiplication and canonical lifts David R. Kohel Abstract The problem of constructing CM invariants of higher dimensional abelian varieties presents significant new challenges relative to CM constructions in dim

            Add to Reading List

            Source URL: www.i2m.univ-amu.fr

            Language: English - Date: 2007-12-31 19:31:08
              170 Autotuning Runtime Specialization for Sparse Matrix-Vector Multiplication BUSE YILMAZ, Ozyegin University BARIS ¸ AKTEMUR, Ozyegin University

              0 Autotuning Runtime Specialization for Sparse Matrix-Vector Multiplication BUSE YILMAZ, Ozyegin University BARIS ¸ AKTEMUR, Ozyegin University

              Add to Reading List

              Source URL: aktemur.github.io

              Language: English - Date: 2018-07-12 16:55:43
                18Diophantine approximation, scalar multiplication and decidability Philipp Hieronymi University of Illinois at Urbana-Champaign Colloquium Logicum 2016

                Diophantine approximation, scalar multiplication and decidability Philipp Hieronymi University of Illinois at Urbana-Champaign Colloquium Logicum 2016

                Add to Reading List

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

                Language: English - Date: 2016-09-21 08:21:41
                  19Impl´ementation Efficiente de la Multiplication Scalaire utilisant la Parall´elisation Cryptographie sur les Courbes Elliptiques Jonathan Taverne

                  Impl´ementation Efficiente de la Multiplication Scalaire utilisant la Parall´elisation Cryptographie sur les Courbes Elliptiques Jonathan Taverne

                  Add to Reading List

                  Source URL: delta.cs.cinvestav.mx

                  Language: French - Date: 2016-08-09 22:49:01
                    20Problem Set 1 Due Tuesday, SeptFind two distinct bases for Q3 . 2. There are 3 bases for F22 . Find them. 3. Let K and L be fields with K a subfield of L (so it is a subset and the multiplication, etc are those co

                    Problem Set 1 Due Tuesday, SeptFind two distinct bases for Q3 . 2. There are 3 bases for F22 . Find them. 3. Let K and L be fields with K a subfield of L (so it is a subset and the multiplication, etc are those co

                    Add to Reading List

                    Source URL: people.virginia.edu

                    Language: English - Date: 2007-09-06 12:45:23