Results 121 to 130 of about 367 (158)

(Inner-Product) Functional Encryption with Updatable Ciphertexts. [PDF]

J Cryptol
Cini V, Ramacher S, Slamanig D, Striecks C, Tairi E.   +4 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On the nonlinearity of monotone Boolean functions

Cryptography and Communications, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Claude Carlet, Carlet Claude
exaly   +4 more sources

Algorithms counting monotone Boolean functions

Information Processing Letters, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andrzej Szepietowski
exaly   +3 more sources

On learning monotone Boolean functions

Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280), 2002
We consider the problem of learning monotone Boolean functions over {0, 1}/sup n/ under the uniform distribution. Specifically, given a polynomial number of uniform random samples for an unknown monotone Boolean function f, and given polynomial completing time, we would like to approximate f as well as possible.
Avrim Blum, Carl Burch, John Langford 0001   +2 more
openaire   +1 more source

Monotone Boolean functions

Russian Mathematical Surveys, 2003
Summary: Monotone Boolean functions are an important object in discrete mathematics and mathematical cybernetics. Topics related to these functions have been actively studied for several decades. Many results have been obtained, and many papers published.
openaire   +2 more sources

Interactive learning of monotone Boolean functions

Information Sciences, 1996
This paper presents some optimal interactive algorithms for some problems related to learning of monotone Boolean functions. These algorithms are based on the fundamental Hansel theorem. The advantage of the algorithms is that they are not heuristics, as is often the case of many known algorithms for general Boolean functions, but they are optimal in ...
Boris Kovalerchuk, Evangelos Triantaphyllou, Aniruddha S. Deshpande, Evgenii Vityaev 0001   +3 more
openaire   +1 more source

The complexity of monotone boolean functions

Mathematical Systems Theory, 1977
We study the realization of monotone Boolean functions by networks. Our main result is a precise version of the following statement: the complexity of realizing a monotone Boolean function ofn arguments is less by the factor (2/πn)1/2, whereπ is the circular ratio, than the complexity of realizing an arbitrary Boolean function ofn arguments.
openaire   +1 more source

Approximation of a partial boolean function by a monotonic boolean function

USSR Computational Mathematics and Mathematical Physics, 1978
Abstract THE PROBLEM of finding a monotonic Boolean function best approximation a specified partial (not defined everywhere) Boolean function, is solved by a flow algorithm. Among the monotonic functions giving the best approximation, the function possessing the simplest disjunctive normal form is chosen.
openaire   +2 more sources

The Monotone Circuit Complexity of Quadratic Boolean Functions

Algorithmica, 2004
Several results on the monotone circuit complexity and the conjunctive complexity, i.e., the minimal number of AND gates in monotone circuits, of quadratic Boolean functions are proved We focus on the comparison between single level circuits, which have only one level of AND gates, and arbitrary monotone circuits, and show that there is a huge gap ...
Kazuyuki Amano, Akira Maruoka
openaire   +1 more source