Results 31 to 40 of about 423,241 (305)
Nearly Optimal Separations Between Communication (or Query) Complexity and Partitions [PDF]
, 2016 We show a nearly quadratic separation between deterministic communication complexity and the logarithm of the partition number, which is essentially optimal. This improves upon a recent power 1.5 separation of Göös, Pitassi, and Watson (FOCS 2015).
Kokainis, Martins +2 more
core +1 more source
Proof Complexity of Natural Formulas via Communication Arguments [PDF]
, 2021 A canonical communication problem Search(φ) is defined for every unsatisfiable CNF φ: an assignment to the variables of φ is partitioned among the communicating parties, they are to find a clause of φ falsified by this assignment.
Itsykson, Dmitry, Riazanov, Artur
core +1 more source
Communication Complexity of Collision
Electron. Colloquium Comput. Complex., 2022 The Collision problem is to decide whether a given list of numbers $(x_1,\ldots,x_n)\in[n]^n$ is $1$-to-$1$ or $2$-to-$1$ when promised one of them is the case. We show an $n^{Ω(1)}$ randomised communication lower bound for the natural two-party version of Collision where Alice holds the first half of the bits of each $x_i$ and Bob holds the second ...
Mika Göös, Siddhartha Jain 0002
openaire +5 more sources
IEEE Access, 2022 The Practical Byzantine Fault Tolerant (PBFT) consensus algorithm has many advantages, which makes PBFT utilized widely. Nonetheless, PBFT is not suitable for large-scale node scenarios due to its high communication complexity and it also has an apparent
Yanhe Na +4 more
doaj +1 more source
Individual communication complexity
Journal of Computer and System Sciences, 2004 We initiate the theory of communication complexity of individual inputs held by the agents, rather than worst-case or average-case. We consider total, partial, and partially correct protocols, one-way versus two-way, with and without help bits. The results are expressed in trems of Kolmogorov complexity.
H.M. Buhrman (Harry) +3 more
openaire +5 more sources
The complexity paradigm for studying human communication: a summary and integration of two fields [PDF]
, 2015 There are more things in heaven and earth, Horatio, than are dreamt of in your philosophy. Hamlet (Act 1, Scene 5). This popular quote from Hamlet might be recast for the field of communication as “There are more things in science than are dreamt of in ...
John Sherry, Sherry, John L.
core +1 more source
Approximate regularised maximum-likelihood approach for censoring outliers
The Journal of Engineering, 2019 This study considers censoring outliers in a radar scenario with limited sample support. The problem is formulated as obtaining the regularised maximum likelihood (RML) estimate of the outlier index set.
Sudan Han +5 more
doaj +1 more source
, 2021 In Natural Communication, the author criticizes the current paradigm of specific goal orientation in the complexity sciences. His model of "natural communication" encapsulates modern theoretical concepts from mathematics and physics, in particular ...
Zafiris, Elias
core +1 more source
New Bounds and a Generalization for Share Conversion for 3-Server PIR
Entropy, 2022 Private Information Retrieval (PIR) protocols, which allow the client to obtain data from servers without revealing its request, have many applications such as anonymous communication, media streaming, blockchain security, advertisement, etc.
Anat Paskin-Cherniavsky, Olga Nissenbaum
doaj +1 more source
Nonlocality and communication complexity [PDF]
, 2009 Quantum information processing is the emerging field that defines and realizes computing devices that make use of quantum mechanical principles such as the superposition principle, entanglement, and interference.
Cleve, R.E. (Richard) +12 more
core +1 more source