Электронный архив

Просмотр по теме "communication complexity"

Просмотр по теме "communication complexity"

Отсортировать по:Сортировать:Результаты поиска на странице:

  • A communication approach to the superposition problem 
    Ablayev F.; Ablayeva S. (2010)
    In function theory the superposition problem is known as the problem of representing a continuous function f(x1,... ,xk) in k variables as the composition of "simpler" functions. This problem stems from the Hilbert's ...
  • Extension of the hierarchy for k-OBDDs of small width 
    Ablayev F.; Khadiev K. (2013)
    In this paper we explore the well-known k-OBDD model of branching programs. We develop a method of representation of the k-OBDD computation process as an "automata-communication protocol" computation process. Our method ...
  • On communication complexity of bent functions from Maiorana–McFarland class 
    Marchenko A. (2016)
    © 2016, Pleiades Publishing, Ltd.In this article we study two party Communication Complexity of Boolean bent functions from Maiorana–McFarland class. In particular, we describe connections between Maiorana–McFarland ...

Поиск в электронном архиве

Просмотр

Моя учетная запись