Hardness

Results: 758



#Item
31On the Hardness of Learning with Rounding over Small Modulus ? Andrej Bogdanov1 , Siyao Guo1 , Daniel Masny2 , Silas Richelson3 , and Alon Rosen4 1

On the Hardness of Learning with Rounding over Small Modulus ? Andrej Bogdanov1 , Siyao Guo1 , Daniel Masny2 , Silas Richelson3 , and Alon Rosen4 1

Add to Reading List

Source URL: eprint.iacr.org

- Date: 2016-02-05 13:31:09
    32Order-Revealing Encryption and the Hardness of Private Learning Mark Bun∗ Mark Zhandry†

    Order-Revealing Encryption and the Hardness of Private Learning Mark Bun∗ Mark Zhandry†

    Add to Reading List

    Source URL: eprint.iacr.org

    - Date: 2015-05-02 22:28:11
      33Can PPAD Hardness be Based on Standard Cryptographic Assumptions? Alon Rosen∗ Gil Segev†

      Can PPAD Hardness be Based on Standard Cryptographic Assumptions? Alon Rosen∗ Gil Segev†

      Add to Reading List

      Source URL: eprint.iacr.org

      - Date: 2016-11-02 14:33:31
        34Can PPAD Hardness be Based on Standard Cryptographic Assumptions? Alon Rosen∗ Gil Segev†

        Can PPAD Hardness be Based on Standard Cryptographic Assumptions? Alon Rosen∗ Gil Segev†

        Add to Reading List

        Source URL: eprint.iacr.org

        - Date: 2016-11-02 14:33:31
          35Lesson Plan: How Do We Know What is Healthy Water? pH /Chlorine / Hardness Estimated Time: 1-3 days State Standards taught and addressed – Grade 8: Standards Taught (and evaluated at end of lesson) • Science Strand 3

          Lesson Plan: How Do We Know What is Healthy Water? pH /Chlorine / Hardness Estimated Time: 1-3 days State Standards taught and addressed – Grade 8: Standards Taught (and evaluated at end of lesson) • Science Strand 3

          Add to Reading List

          Source URL: www.srpnet.com

          - Date: 2011-03-02 17:23:50
            36On the Hardness of Learning with Rounding over Small Modulus ? Andrej Bogdanov1 , Siyao Guo1 , Daniel Masny2 , Silas Richelson3 , and Alon Rosen4 1

            On the Hardness of Learning with Rounding over Small Modulus ? Andrej Bogdanov1 , Siyao Guo1 , Daniel Masny2 , Silas Richelson3 , and Alon Rosen4 1

            Add to Reading List

            Source URL: eprint.iacr.org

            - Date: 2016-02-05 13:31:09
              37The Exact Hardness of Deciding Derivational and Runtime Complexity∗ Andreas Schnabl1 and Jakob Grue Simonsen2 1 Institute of Computer Science, University of Innsbruck

              The Exact Hardness of Deciding Derivational and Runtime Complexity∗ Andreas Schnabl1 and Jakob Grue Simonsen2 1 Institute of Computer Science, University of Innsbruck

              Add to Reading List

              Source URL: drops.dagstuhl.de

              - Date: 2011-08-31 03:31:59
                38Proof, beliefs, and algorithms through the lens of sum-of-squares 1 From integrality gaps to hardness We have seen how we can transform computational hardness results into integrality gaps. In a surprising work Raghaven

                Proof, beliefs, and algorithms through the lens of sum-of-squares 1 From integrality gaps to hardness We have seen how we can transform computational hardness results into integrality gaps. In a surprising work Raghaven

                Add to Reading List

                Source URL: sumofsquares.org

                - Date: 2016-11-17 19:44:26
                  39Proof, beliefs, and algorithms through the lens of sum-of-squares 1 Higher-degree integrality gaps: from computational hardness to limitations of sum-of-squares

                  Proof, beliefs, and algorithms through the lens of sum-of-squares 1 Higher-degree integrality gaps: from computational hardness to limitations of sum-of-squares

                  Add to Reading List

                  Source URL: sumofsquares.org

                  - Date: 2016-11-17 19:44:26
                    40It Only Takes a Few: On the Hardness of Voting With a Constant Number of Agents Felix Brandt Paul Harrenstein

                    It Only Takes a Few: On the Hardness of Voting With a Constant Number of Agents Felix Brandt Paul Harrenstein

                    Add to Reading List

                    Source URL: www.ifaamas.org

                    - Date: 2013-03-20 08:05:10