Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 627 for “"Proofs"”.
-
Modern Interactive Proofs
… several extensions of the concept of interactive proofs. First, we consider non-signaling multi-prover interactive proofs. Interacting with multiple non-interacting provers increases the ability of the verifier to check the solution by asking the provers different questions and checking the …
-
Efficient holographic proofs
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1996.
-
Super-efficient rational proofs
… I previously introduced and studied Rational Proofs when the verifier, Arthur, is a probabilistic polynomial-time machine [3]. In this thesis, I characterize super-efficient rational proofs, that is, rational proofs where Arthur runs in logarithmic time. These new rational proofs are very …
-
On Proofs of Sylow's Theorem
We give five proofs of Sylow's Theorem. The proofs given will be Sylow's original proof, the Cauchy-Frobenius proof using double cosets, Frobenius' proof (two versions) using the class equation, and Wielandt's proof using subsets. We give a number of different examples to illustrate the various …
-
Quadratic Reciprocity: Proofs and Applications
… The purpose of this thesis is to present several proofs as well as applications of the law of quadratic reciprocity. I will present three proofs of the quadratic reciprocity. We begin with a proof that depends on Gauss's lemma and Eisenstein's lemma. We then describe another proof due to Eisentein …
-
Formalizing soundness proofs of SNARKs
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-02-04 without embargo terms
-
Succinct Cryptography via Propositional Proofs
… thesis, we show how to leverage propositional proofs to overcome the non-falsifiability barrier, and make substantial progress in the goal of achieving succinctness in both settings. Our main result is universal construction of both SNARGs and succinct IO for Turing machines from standard …
-
Noise resilience of proofs of quantumness
Achieving quantum computational advantage requires solving a conjectured classically intractable problem on a quantum device. A proof of quantumness is a type of challenge-response protocol inspired by cryptographic protocols in which a classical verifier can certify the quantum advantage of an …
-
On the Constructive Content of Proofs
… of techniques for extracting programs from proofs. We focus on constructive theories of inductive definitions and classical systems allowing choice principles. Special emphasis is put on optimizations that allow for the extraction of realistic programs. Our main field of application is …
-
Euclidean proofs of projective geometry theorems /
Thesis (M.A.)--University of Kansas, Mathematics, 1922. ; Includes bibliographical references.
-
Modular Compilers and Their Correctness Proofs
… provides both a level of modularity in compiler proofs as well as a useful organizing principle for such proofs.
-
Digital signatures from probabilistically checkable proofs
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1995.
-
Automated termination proofs using Walther recursion
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1994.
-
Formal proofs concerning partial recursive functions.
Massachusetts Institute of Technology. Dept. of Electrical Engineering. Thesis. 1966. M.S.
-
On deploying succinct zero-knowledge proofs
Zero-knowledge proofs, introduced by Goldwasser, Micali, and Rackoff, are a fundamental building block in theoretical cryptography with numerous applications. Still, the impact of zero-knowledge proofs for building secure systems in practice has been modest at best. Part of this can be explained by …
-
Verifying quantum proofs with entangled games
… science techniques for efficiently checking proofs with Bell inequalities. Stated more formally, the main result of this thesis is a multi-prover interactive proof protocol, in which a classical verifier exchanging only O(log(n)) bits of classical communication with 7 untrusted, entangled …
-
Decomposition of stability proofs for hybrid systems
Hybride Systeme dienen der Beschreibung der Interaktion von zeitkontinuierlichem und zeitdiskretem Verhalten, wie sie beispielsweise in eingebetteten Systemen stattfindet. Ein Beschreibungsmittel für solche Systeme sind hybride Automatenmodelle, endliche Automaten angereichert mit …
-
Studies in mechanical verification of mathematical proofs
Contains fulltext : 18727_studinmev.pdf (Publisher’s version ) (Open Access)
-
Deep Inference and Symmetry in Classical Proofs
In this thesis we see deductive systems for classical propositional and predicate logic which use deep inference, i.e. inference rules apply arbitrarily deep inside formulas, and a certain symmetry, which provides an involution on derivations. Like sequent systems, they have a cut rule which is …
-
Proofs and computations in conditional equational theories
… programming. In this thesis, we study how to do proofs and computations in conditional equational theories, using rewriting techniques.
Page 1 of 32