Concept
Algorithmically random sequence
Related publications (55)
On Succinct Non-interactive Arguments in Relativized Worlds
Succinct non-interactive arguments of knowledge (SNARKs) are cryptographic proofs with strong efficiency properties. Applications of SNARKs often involve proving computations that include the SNARK verifier, a technique called recursive composition. Unfort ...
SPRINGER INTERNATIONAL PUBLISHING AG2022Planted matching problems on random hypergraphs
Lenka Zdeborová, Anshul Toshniwal, Gabriele Sicuro
We consider the problem of inferring a matching hidden in a weighted random k-hypergraph. We assume that the hyperedges' weights are random and distributed according to two different densities conditioning on the fact that they belong to the hidden matchin ...
2022Random flip-flop: adding quantum randomness to digital circuits for improved cyber security, artificial intelligence and more
Edoardo Charbon, Claudio Bruschini, Ivan Michel Antolovic, Mario Stipcevic
Harnessing quantum randomness for the generation of random numbers is an important concept crucial for information security and many other computer-related applications. Quantum random number generators (QRNGs) are evolving from bulky, slow, and expensive ...
SPIE2021Disorder‐Induced Signal Filtering with Topological Metamaterials
Romain Christophe Rémy Fleury, Farzad Zangeneh Nejad
Disorder, ubiquitously present in realistic structures, is generally thought to disturb the performance of analog wave devices, as it often causes strong multiple scattering effects that largely arrest wave transportation. Contrary to this general view, he ...
2020