По вашему запросу найдено документов: 47909
Страница 1 из 4791
Lower bounds for one-way probabilistic communication complexity and their application to space complexity are proved in terms of the deterministic communication complexity of functions and in terms of the notion
The complexity of classical and quantum branching programs: A communication complexity approachWe present a survey of the communication point of view for a complexity lower bounds proof
On communication complexity of bent functions from Maiorana–McFarland class© 2016, Pleiades Publishing, Ltd.In this article we study two party Communication Complexity
Lower bounds for one-way probabilistic communication complexity and their application to space complexity are proved in terms of the deterministic communication complexity of functions and in terms of the notion
On communication complexity of bent functions from Maiorana–McFarland class© 2016, Pleiades Publishing, Ltd.In this article we study two party Communication Complexity
Quantum communications based on quantum hashing quantum hashing technique for computing Boolean functions in the quantum communication model
ADEQUATE CONVEYANCE OF COMMUNICATIVEPRAGMATIC ASPECT OF INFORMATION IN COMPLEX SENTENCESThe object of our investigation is is the complex sentence and its features in Russian and English
Software and hardware development and testing of repeaters of communication satellitesThe article describes a software and hardware complex based on National Instruments. It provides
Dialogic speech as a field of compound-complex sentence communicative types applicationThe purpose of the article is to identify the specifics of compound-complex sentences functioning
The complexity of classical and quantum branching programs: A communication complexity approachWe present a survey of the communication point of view for a complexity lower bounds proof
Страница 1 из 4791
Фасеты
Партнеры
Индексация
