Results 11 to 20 of about 423,241 (305)
Communication complexity hierarchy
Theoretical Computer Science, 1986 Communication complexity of languages, defined by \textit{Ch. Papadimitriou} and \textit{M. Sipser} [J. Comput. Syst. Sci. 28, 260-269 (1984; Zbl 0584.68064)] is a tool for proving lower bounds on the area complexity and on the area-time squared complexity of VLSI circuits recognizing these languages. The abstract communication complexity model and its
Hromkovič, Juraj
openaire +3 more sources
Communication Complexity with Defective Randomness [PDF]
, 2021 Starting with the two standard model of randomized communication complexity, we study the communication complexity of functions when the protocol has access to a defective source of randomness.
Ball, Marshall +2 more
core +1 more source
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
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
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
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
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
Learning Complexity vs. Communication Complexity [PDF]
2008 23rd Annual IEEE Conference on Computational Complexity, 2008 This paper has two main focal points. We first consider an important class of machine learning algorithms: large margin classifiers, such as Support Vector Machines. The notion of margin complexity quantifies the extent to which a given class of functions can be learned by large margin classifiers.
Nati Linial, Adi Shraibman
openaire +1 more source
Journal of Computer and System Sciences, 1982 Suppose that a language \(L\subseteq \{0,1\}^*\) must be recognized by two distant computers. Each computer receives half of the input bits, and the computation proceeds using some protocol for communication between the two computers (obviously, most interesting languages cannot be recognized with any communication). The minimum number of bits that has
Christos H. Papadimitriou +1 more
openaire +2 more sources