Proof

Results: 11440



#Item
51Proof-producing reflection for HOL with an application to model polymorphism Benja Fallenstein1 and Ramana Kumar2 1  2

Proof-producing reflection for HOL with an application to model polymorphism Benja Fallenstein1 and Ramana Kumar2 1 2

Add to Reading List

Source URL: cakeml.org

Language: English - Date: 2016-04-20 00:08:12
52The Proof is in the Pudding Proofs of Work for Solving Discrete Logarithms Marcella Hastings1 , Nadia Heninger1 , and Eric Wustrow2 1  University of Pennsylvania

The Proof is in the Pudding Proofs of Work for Solving Discrete Logarithms Marcella Hastings1 , Nadia Heninger1 , and Eric Wustrow2 1 University of Pennsylvania

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2018-10-05 10:39:17
53COSC 544 Probabilistic Proof SystemsA PCP of Quasilinear Size for Arithmetic Circuit-SAT Lecturer: Justin Thaler

COSC 544 Probabilistic Proof SystemsA PCP of Quasilinear Size for Arithmetic Circuit-SAT Lecturer: Justin Thaler

Add to Reading List

Source URL: people.cs.georgetown.edu

Language: English - Date: 2017-11-22 13:48:36
54Semantic Security Invariance under Variant Computational Assumptions Eftychios Theodorakis? and John C. Mitchell?? Abstract. A game-based cryptographic proof is a relation that establishes equivalence between probabilist

Semantic Security Invariance under Variant Computational Assumptions Eftychios Theodorakis? and John C. Mitchell?? Abstract. A game-based cryptographic proof is a relation that establishes equivalence between probabilist

Add to Reading List

Source URL: eftychis.org

Language: English - Date: 2018-02-16 15:03:09
55OUP CORRECTED PROOF – FINAL, , SPi   ENHANCED PUNISHMENT Can technology make life sentences longer?

OUP CORRECTED PROOF – FINAL, , SPi  ENHANCED PUNISHMENT Can technology make life sentences longer?

Add to Reading List

Source URL: rebeccaroache.weebly.com

Language: English - Date: 2018-09-09 19:16:59
56Introduction Finite Model Generation Proof-Producing SAT Solvers Satisfiability Modulo Theories  Finite Model Generation, Proof-Producing

Introduction Finite Model Generation Proof-Producing SAT Solvers Satisfiability Modulo Theories Finite Model Generation, Proof-Producing

Add to Reading List

Source URL: user.it.uu.se

Language: English - Date: 2009-02-03 09:54:08
57The Potential of Interference-Based Proof Systems Marijn J.H. Heule and Benjamin Kiesl The University of Texas at Austin and Vienna University of Technology ARCADE in Gothenburg, Sweden

The Potential of Interference-Based Proof Systems Marijn J.H. Heule and Benjamin Kiesl The University of Texas at Austin and Vienna University of Technology ARCADE in Gothenburg, Sweden

Add to Reading List

Source URL: www.cs.utexas.edu

Language: English - Date: 2017-08-06 02:05:36
58COSC 544 Probabilistic Proof SystemsThe Power of Randomness: Fingerprinting and Freivalds’ Algorithm Lecturer: Justin Thaler

COSC 544 Probabilistic Proof SystemsThe Power of Randomness: Fingerprinting and Freivalds’ Algorithm Lecturer: Justin Thaler

Add to Reading List

Source URL: people.cs.georgetown.edu

Language: English - Date: 2017-09-14 15:31:47
59Advanced Proof Viewing in PROOFTOOL UITP 2014 Tomer Libal, Martin Riener, Mikheil Rukhaia July 17, 2014

Advanced Proof Viewing in PROOFTOOL UITP 2014 Tomer Libal, Martin Riener, Mikheil Rukhaia July 17, 2014

Add to Reading List

Source URL: www.logic.at

Language: English - Date: 2014-07-19 11:42:53
60Malleable Proof Systems and Applications Melissa Chase (MSR Redmond) Markulf Kohlweiss (MSR Cambridge) Anna Lysyanskaya (Brown University) Sarah Meiklejohn (UC San Diego)

Malleable Proof Systems and Applications Melissa Chase (MSR Redmond) Markulf Kohlweiss (MSR Cambridge) Anna Lysyanskaya (Brown University) Sarah Meiklejohn (UC San Diego)

Add to Reading List

Source URL: smeiklej.com

Language: English - Date: 2018-10-23 14:58:02