Arithmetic

Results: 8697



#Item
131

Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation From Degree-5 Multilinear Maps Prabhanjan Ananth∗

Add to Reading List

Source URL: eprint.iacr.org

- Date: 2016-11-22 03:25:27
    132

    Complexity Winter School Marseille - January 30 - FebruaryMonday January 30 10h45 : Opening. 11h-12h30 : Yiannis N. Moschovakis - Relative complexity in arithmetic and algebra.

    Add to Reading List

    Source URL: perso.ens-lyon.fr

    - Date: 2012-01-11 16:21:47
      133

      A SHORT PROOF OF THE PRIME NUMBER THEOREM FOR ARITHMETIC PROGRESSIONS IVAN SOPROUNOV Abstract. We give a short proof of the Prime Number Theorem for arithmetic progressions following the ideas of recent Newman’s short

      Add to Reading List

      Source URL: academic.csuohio.edu

      - Date: 2011-03-22 17:43:57
        134

        SPECIAL MANIFOLDS, ARITHMETIC AND HYPERBOLIC ASPECTS: A SHORT SURVEY ´ ERIC ´ FRED CAMPANA

        Add to Reading List

        Source URL: www.mast.queensu.ca

        - Date: 2014-07-09 09:20:22
          135

          Doc No: N2137=A Proposal to add Interval Arithmetic to the C++ Standard Library (revision 2) Hervé Brönnimann∗

          Add to Reading List

          Source URL: www.open-std.org

          - Date: 2006-11-01 01:59:04
            136

            Monomials in arithmetic circuits: Complete problems in the counting hierarchy Hervé Fournier1 , Guillaume Malod1 , and Stefan Mengel∗2 1 Univ Paris Diderot, Sorbonne Paris Cité,

            Add to Reading List

            Source URL: drops.dagstuhl.de

            - Date: 2012-02-24 06:03:32
              137

              CVC4 1.5 for Sygus Comp 2015 • CVC4 is an SMT solver • Fourth generation of Cooperating Validity Checker (CVC, CVC Lite, CVC3, CVC4) • Supports many ground theories: • Linear arithmetic, bitvectors, UF, datatypes

              Add to Reading List

              Source URL: formal.epfl.ch

              - Date: 2015-07-21 12:55:02
                138

                Journal on Satisfiability, Boolean Modeling and Computation–236 Efficient Solving of Large Non-linear Arithmetic Constraint Systems with Complex Boolean Structure∗ Martin Fr¨ anzle

                Add to Reading List

                Source URL: jsat.ewi.tudelft.nl

                - Date: 2007-05-22 16:56:57
                  139

                  How to Garble Arithmetic Circuits∗ Benny Applebaum† Yuval Ishai‡ Eyal Kushilevitz§

                  Add to Reading List

                  Source URL: www.eng.tau.ac.il

                  - Date: 2012-12-14 03:40:31
                    140

                    Lecture 1, September 8 Algebra developed within arithmetic, many of the constructions were inspired by number-theoretic considerations. Even today, the analogy between the rings Z, C[t], and Fp [t] is one of the guiding

                    Add to Reading List

                    Source URL: www.math.nyu.edu

                    - Date: 2016-09-14 08:43:44
                      UPDATE