Results 281 to 290 of about 2,172,394 (315)

The complexity of AND—decomposition of Boolean functions

Discrete Applied Mathematics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pavel G. Emelyanov, Denis K. Ponomaryov
openaire   +1 more source

On the complexity of proving functions

Proceedings of the November 16-18, 1971, fall joint computer conference on - AFIPS '71 (Fall), 1971
Let f be a recursive function. We shall be interested in the following question: given x and y, how difficult is it to decide whether f(x) = y or f(x) ≠ y? Since the problem of deciding f(x) = y or f(x) ≠ y is the same problem as that of computing the characteristic function Cf of the graph of f, we can study the above question by looking into the ...
openaire   +1 more source

Phosphoinositides in Golgi Complex Function

2012
The Golgi complex is a ribbon-like organelle composed of stacks of flat cisternae interconnected by tubular junctions. It occupies a central position in the endomembrane system as proteins and lipids that are synthesized in the endoplasmic reticulum (ER) pass through the Golgi complex to undergo biosynthetic modification (mainly glycosylation) and to ...
D’Angelo, Giovanni, Vicinanza, Mariella, Wilson, Cathal, DE MATTEIS, Maria Antonietta   +3 more
openaire   +5 more sources

Complex functions of the brain

Zoology, 2001
Over the course of the last 50 years it has been possible to solve a number of basic problems in neurobiology. Interest is now turning more and more to problems concerning so-called "higher" brain functions, including cognition. Examples from the visual system in primates are presented.
openaire   +3 more sources

Complex Numbers and Functions

2016
We introduced complex numbers in Sect. 1.8 of the first volume. There we just defined the numbers themselves, but did not go any further. In fact, since the introduction of complex numbers a number of centuries ago, the theory based on them has been substantially developed into an extended analysis of complex functions defined on the complex plane. The
openaire   +1 more source

On the complexity of balanced Boolean functions

Information Processing Letters, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +4 more sources

Complexity Classes for Partial Functions

1993
We will survey relations between several complexity classes of functions that correspond to well-known complexity classes of sets (decision problems). Usually, two function classes collapse if and only if the corresponding set classes collapse. However, surprises will occur.
openaire   +2 more sources

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

Complex Hyperbolic function charts

Electrical Engineering, 1935
Discussion of a paper by L. F. Woodruff published in the May 1935 issue, pages 550–4. A. E. Kennelly (Harvard University, Cambridge, Mass.): The charts offered in the paper will be serviceable to transmission engineers and to all those who are interested in alternating current lines having at operating frequency an angle not exceeding 0.4 in size.
openaire   +1 more source

On the Multiplicative Complexity of Boolean Functions

Fundamenta Informaticae, 2016
The multiplicative complexity μ(f) of a Boolean function f is the smallest number of & (of AND gates) in circuits in the basis {x&y, x⊕y, 1} such that each circuit implements the function f. By μ(S) we denote the number of & (of AND gates) in a circuit S in the basis {x&y, x ⊕ y, 1}. We present a method to construct circuits in the basis {x&y, x ⊕ y, 1}
openaire   +1 more source