Filters
The Layer complexity of Arthur-Merlin-like communication
In communication complexity the Arthur-Merlin (AM) model is the most natural one that allows both randomness and nondeterminism. Presently we do not have any super-logarithmic lower bound for the AM-complexity of an explici...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2021 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Bare quantum simultaneity versus classical interactivity in communication complexity
A relational bipartite communication problem is presented that has an efficient quantum simultaneous-messages protocol, but no efficient classical two-way protocol....
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2020 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Bare quantum simultaneity versus classical interactivity in communication complexity
A relational bipartite communication problem is presented that has an efficient quantum simultaneous-messages protocol, but no efficient classical two-way protocol....
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2021 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
complex of approaches: development of communication - technics
complex of approaches to the training and development of communication...
AN - Psychologie
- 2002 •
- B
Rok uplatnění
B - Odborná kniha
An Application of Hindman.and.s Theorem to a Problem on Communication Complexity.
We consider the k-party communication complexity of the problem of determiningif a word w is of the form ..........., for fixed letters....... . Using the well-known theorem of Hindman (a Ramsey-type result about finite subsets of n...
BA - Obecná matematika
- 2003 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Languages with Bounded Multiparty Communication Complexity
We study languages with bounded communication complexity in the multiparty and constant communication complexity for k players for some fixed k, then the language complexity for some fixed k iff it has bou...
BA - Obecná matematika
- 2007 •
- D
Rok uplatnění
D - Stať ve sborníku
Complex communicate and iconization of media discourse
Iconic sins are considered to be the newspeak in contemporary media discourse that makes communication more difficult.
AJ - Písemnictví, mas–media, audiovize
- 2004 •
- D
Rok uplatnění
D - Stať ve sborníku
Models of community safety management
It is described the complex community management system in which the following premises hold: community is open system; community assets are all basic public assets; safe community has all assets on which ...
AE - Řízení, správa a administrativa
- 2011 •
- D
Rok uplatnění
D - Stať ve sborníku
Chitin-Glucan Complex Production by Schizophyllum commune Submerged Cultivation
as an industrial chitin-glucan complex source. Basidiomycete Schizophyllum commune submerged cultivation for chitin-glucan complex production was studied. Optimized conditions accumulation was achieved most efficiently. Ch...
EE - Mikrobiologie, virologie
- 2011 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Exponential Separation of Quantum and Classical Non-Interactive Multi-Party Communication Complexity
We give the first exponential separation between quantum and classical multi-party communication complexity in the (non-interactive) one-way and simultaneous message passing settings......
BA - Obecná matematika
- 2008 •
- D
Rok uplatnění
D - Stať ve sborníku
- 1 - 10 out of 116 483