31![On 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](https://www.pdfsearch.io/img/ac1bb73fc0f92d3dd6575d865bdd8867.jpg) | Add to Reading ListSource URL: eprint.iacr.org- Date: 2016-02-05 13:31:09
|
---|
32![Order-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†](https://www.pdfsearch.io/img/9eb06d2dbc69a922c217669b106044a3.jpg) | Add to Reading ListSource URL: eprint.iacr.org- Date: 2015-05-02 22:28:11
|
---|
33![Can 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†](https://www.pdfsearch.io/img/79d471844f342f981527d56f75d76ac3.jpg) | Add to Reading ListSource URL: eprint.iacr.org- Date: 2016-11-02 14:33:31
|
---|
34![Can 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†](https://www.pdfsearch.io/img/f9d54a51c99ac575596796fd4c6af24a.jpg) | Add to Reading ListSource URL: eprint.iacr.org- Date: 2016-11-02 14:33:31
|
---|
35![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 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](https://www.pdfsearch.io/img/c42bd7c317307c7fbbf81151dd5f86f9.jpg) | Add to Reading ListSource URL: www.srpnet.com- Date: 2011-03-02 17:23:50
|
---|
36![On 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](https://www.pdfsearch.io/img/64dc921f6ccc69f6b519bb29408ab89a.jpg) | Add to Reading ListSource URL: eprint.iacr.org- Date: 2016-02-05 13:31:09
|
---|
37![The 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](https://www.pdfsearch.io/img/4c16f98653ab37d1112977dcf442f086.jpg) | Add to Reading ListSource URL: drops.dagstuhl.de- Date: 2011-08-31 03:31:59
|
---|
38![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 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](https://www.pdfsearch.io/img/3a85940d5f9f578b7ec92c1eb002d46a.jpg) | Add to Reading ListSource URL: sumofsquares.org- Date: 2016-11-17 19:44:26
|
---|
39![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 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](https://www.pdfsearch.io/img/acc0e99e3aabf2058ad89524c9979769.jpg) | Add to Reading ListSource URL: sumofsquares.org- Date: 2016-11-17 19:44:26
|
---|
40![It 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](https://www.pdfsearch.io/img/be79698798723d65129d88dcba70aeff.jpg) | Add to Reading ListSource URL: www.ifaamas.org- Date: 2013-03-20 08:05:10
|
---|