Results 51 to 60 of about 38,400 (270)
Verified Computations for Hyperbolic 3-Manifolds [PDF]
Experimental Mathematics, 2015 For a given cusped 3-manifold $M$ admitting an ideal triangulation, we describe a method to rigorously prove that either $M$ or a filling of $M$ admits a complete hyperbolic structure via verified computer calculations. Central to our method are an implementation of interval arithmetic and Krawczyk's Test. These techniques represent an improvement over
Hoffman, N. +5 more
openaire +3 more sources
Verifying computations with streaming interactive proofs [PDF]
Proceedings of the VLDB Endowment, 2011 When computation is outsourced, the data owner would like to be assured that the desired computation has been performed correctly by the service provider. In theory, proof systems can give the necessary assurance, but prior work is not sufficiently scalable or practical. In this paper, we develop new proof protocols for verifying computations which are
Cormode, Graham, Thaler, Justin, Yi, Ke
openaire +2 more sources
Merlin-Arthur with efficient quantum Merlin and quantum supremacy for the second level of the Fourier hierarchy [PDF]
, 2018 We introduce a simple sub-universal quantum computing model, which we call the Hadamard-classical circuit with one-qubit (HC1Q) model. It consists of a classical reversible circuit sandwiched by two layers of Hadamard gates, and therefore it is in the ...
Morimae, Tomoyuki +2 more
core +2 more sources
Self-guaranteed measurement-based quantum computation
, 2017 In order to guarantee the output of a quantum computation, we usually assume that the component devices are trusted. However, when the total computation process is large, it is not easy to guarantee the whole system when we have scaling effects ...
Hajdusek, Michal, Hayashi, Masahito
core +1 more source
Verifying Kottwitz’ conjecture by computer
Representation Theory of the American Mathematical Society, 2000 In these notes I will discuss the computations that were used to verify the main conjecture of Kottwitz (1997) for the groups E 6 E_{6} , E 7 E_{7} , E 8 E_{8} , and the subsidiary one for
openaire +2 more sources
Verified Scalable Parallel Computing with Why3
, 2023 BSML is a pure functional library for the multi-paradigm language OCaml. BSML embodies the principles of the Bulk Synchronous Parallel (BSP) model, a model of scalable parallel computing. We propose a formalization of BSML primitives with WhyML, the specification language of Why3 and specify and prove the correctness of most of the BSML standard ...
Olivia Proust, Frédéric Loulergue
openaire +2 more sources
A Publicly Verifiable Multi-Secret Sharing Scheme With Outsourcing Secret Reconstruction
IEEE Access, 2018 A publicly verifiable secret sharing (PVSS) scheme enjoys the public verification and the lower cost of communication than VSS scheme. However, the existing PVSS schemes cannot be applied in the scenarios of the devices with low computation ability and ...
Changlu Lin +3 more
doaj +1 more source
Composable security of delegated quantum computation
, 2014 Delegating difficult computations to remote large computation facilities, with appropriate security guarantees, is a possible solution for the ever-growing needs of personal computing power.
A. Broadbent +23 more
core +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Pediatric gastroenteropancreatic neuroendocrine neoplasms (GEP‐NENs) are extremely rare and clinically heterogeneous. Management has largely been extrapolated from adult practice. This European Standard Clinical Practice Guideline (ESCP), developed by the EXPeRT network in collaboration with adult NEN experts, provides (adult) evidence ...
Michaela Kuhlen +23 more
wiley +1 more source
A Hardware-Based Correct Execution Environment Supporting Virtual Memory
IEEE AccessThe rapid increase in data generation has led to outsourcing computation to cloud service providers, allowing clients to handle large tasks without investing resources.
Daehyeon Lee +8 more
doaj +1 more source