Results 11 to 20 of about 243 (214)
Cryptography and Algorithmic Randomness [PDF]
Theory of Computing Systems, 2014 34 pages, LaTeX2e, no ...
Kohtaro Tadaki, Norihisa Doi
openaire +2 more sources
Quantum algorithmic randomness [PDF]
Journal of Mathematical Physics, 2021 Quantum Martin-Löf randomness (q-MLR) for infinite qubit sequences was introduced by Nies and Scholz [J. Math. Phys. 60(9), 092201 (2019)]. We define a notion of quantum Solovay randomness, which is equivalent to q-MLR. The proof of this goes through a purely linear algebraic result about approximating density matrices by subspaces.
openaire +2 more sources
Generic Hardware Private Circuits
Transactions on Cryptographic Hardware and Embedded Systems, 2021 With an increasing number of mobile devices and their high accessibility, protecting the implementation of cryptographic functions in the presence of physical adversaries has become more relevant than ever.
David Knichel +2 more
doaj +1 more source
Probabilistic Algorithmic Randomness
The Journal of Symbolic Logic, 2013 AbstractWe introduce martingales defined by probabilistic strategies, in which randomness is used to decide whether to bet. We show that different criteria for the success of computable probabilistic strategies can be used to characterize ML-randomness, computable randomness, and partial computable randomness.
Sam Buss, Mia Minnes
openaire +2 more sources
Randomized priority algorithms
Theoretical Computer Science, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Angelopoulos, Spyros, Borodin, Allan
openaire +4 more sources
On the Randomized Kaczmarz Algorithm [PDF]
IEEE Signal Processing Letters, 2014 The Randomized Kaczmarz Algorithm is a randomized method which aims at solving a consistent system of over determined linear equations. This note discusses how to find an optimized randomization scheme for this algorithm, which is related to the question raised by \cite{c2}. Illustrative experiments are conducted to support the findings.
Liang Dai 0002 +2 more
openaire +2 more sources
A Review of Graph and Network Complexity from an Algorithmic Information Perspective
Entropy, 2018 Information-theoretic-based measures have been useful in quantifying network complexity. Here we briefly survey and contrast (algorithmic) information-theoretic methods which have been used to characterize graphs and networks. We illustrate the strengths
Hector Zenil +2 more
doaj +1 more source
INSAM, 2023 This study explores the utilization of blockchain data as a set of pseudorandom numbers in the context of microtonal algorithmic composition. Conventional methods of generating indiscriminate numbers often lack the desired levels of unpredictability and ...
Krzysztof Kicior
doaj +1 more source
Proofs of randomized algorithms in Coq [PDF]
Science of Computer Programming, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Audebaud, Philippe +1 more
openaire +3 more sources
LT^2C^2: A language of thought with Turing-computable Kolmogorov complexity [PDF]
Papers in Physics, 2013 In this paper, we present a theoretical effort to connect the theory of program size to psychology by implementing a concrete language of thought with Turing-computable Kolmogorov complexity (LT^2C^2) satisfying the following requirements: 1) to be ...
Santiago Figueira +2 more
doaj +3 more sources