Results 31 to 40 of about 5,642,848 (291)
Compressed Communication Complexity of Hamming Distance
Algorithms, 2021 We consider the communication complexity of the Hamming distance of two strings. Bille et al. [SPIRE 2018] considered the communication complexity of the longest common prefix (LCP) problem in the setting where the two parties have their strings in a ...
Shiori Mitsuya +4 more
doaj +1 more source
The Communication Complexity of Correlation [PDF]
Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07), 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Prahladh Harsha +3 more
openaire +3 more sources
A Scalable Byzantine Fault Tolerance Algorithm Based on a Tree Topology Network
IEEE Access, 2023 The consortium chain is the main form of application of blockchain technology in the actual industry, and its consensus mechanism mostly adopts the practical Byzantine fault tolerance (PBFT) algorithm.
Wangxi Jiang +4 more
doaj +1 more source
Communication complexity of byzantine agreement, revisited [PDF]
Distributed computing, 2018 As Byzantine Agreement (BA) protocols find application in large-scale decentralized cryptocurrencies, an increasingly important problem is to design BA protocols with improved communication complexity.
Ittai Abraham +6 more
semanticscholar +1 more source
Efficient inner product arguments and their applications in range proofs
IET Information Security, 2023 Inner product arguments allow a prover to prove that the inner product of two committed vectors equals a public scalar. They are used to reduce the complexity of many cryptographic primitives, such as range proofs.
Zibo Zhou +4 more
doaj +1 more source
Experimental Quantum Switching for Exponentially Superior Quantum Communication Complexity. [PDF]
Physical Review Letters, 2018 Finding exponential separation between quantum and classical information tasks is like striking gold in quantum information research. Such an advantage is believed to hold for quantum computing but is proven for quantum communication complexity. Recently,
Kejin Wei +15 more
semanticscholar +1 more source
Time‐specific encrypted range query with minimum leakage disclosure
IET Information Security, 2021 A time‐specific encrypted range query scheme that has the following properties is proposed. (1) The proposed scheme has trapdoor privacy and data privacy so that a semi‐honest cloud is not able to get any useful information from given ciphertexts and ...
Ozgur Oksuz
doaj +1 more source
Frontiers in Computational Neuroscience, 2023 Being able to objectively characterize the intrinsic complexity of behavioral patterns resulting from human or animal decisions is fundamental for deconvolving cognition and designing autonomous artificial intelligence systems.
Hector Zenil +4 more
doaj +1 more source
Quantum versus Randomized Communication Complexity, with Efficient Players [PDF]
Computational Complexity, 2019 We study a new type of separations between quantum and classical communication complexity, separations that are obtained using quantum protocols where all parties are efficient , in the sense that they can be implemented by small quantum circuits, with ...
Uma Girish, R. Raz, Avishay Tal
semanticscholar +1 more source
The structure of communication problems in cellular automata [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 Studying cellular automata with methods from communication complexity appears to be a promising approach. In the past, interesting connections between communication complexity and intrinsic universality in cellular automata were shown.
Raimundo Briceño +1 more
doaj +1 more source