Results 251 to 260 of about 5,251,527 (295)

Unveiling toxicological adverse outcomes: toward construction and simulation of large-scale networks. [PDF]

Toxicol Sci
Ikonomi N, Ketter N, Pepe MAA.
europepmc   +1 more source

Engineering viral protease-operated nanobodies for programmable and orthogonal control of protein function. [PDF]

Nat Commun
Cui M, Liu X, Lan TH, Wang T, Nonomura T, McKee B, Wang R, Huang Y, Zhou Y.   +8 more
europepmc   +1 more source

Sensor-Modality-Aware Human Activity Recognition with the Convolutional Tsetlin Machine: Interpretable and Resource-Efficient Neuro-Symbolic Learning. [PDF]

Sensors (Basel)
Tarasyuk O, Gorbenko A, Gordieiev O, Akulynichev A, Shafik R, Yakovlev A.   +5 more
europepmc   +1 more source

Exponential Advantage of Multipartite Entanglement over Quantum Communication with Applications to Bounded-Storage Cryptography

Chakraborty A, Banik M, de Wolf R.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

The graph of a boolean function

Journal of Experimental and Theoretical Artificial Intelligence, 1989
Abstract In this semi-expository note, we first recall that every boolean function f of n variables is determined uniquely by a certain subset S of the nodes of the hypercube Q". We then propose the subgraph of Qn induced by S as a realization of f, and call it the graph of a boolean function.
exaly   +3 more sources

Graph Functions of Boolean Functions

IEEE Transactions on Computers, 1984
We introduce and characterize those Boolean functions (graph functions) which can be regarded as characteristic functions of graphs of other Boolean functions. An algorithm for detecting these functions is also presented. Finally, we discuss the complexity of computing a Boolean function which can be regarded as a graph function.
Corina Reischer, Dan A. Simovici
openaire   +2 more sources

On Complementation of Boolean Functions

IEEE Transactions on Computers, 1972
A theorem is presented that simplifies the computations necessary for complementing a Boolean function.
Se June Hong, Daniel L. Ostapko
openaire   +3 more sources

Almost Boolean functions: the design of Boolean functions by spectral inversion

The 2003 Congress on Evolutionary Computation, 2003. CEC '03., 2004
The design of Boolean functions with properties of cryptographic significance is a hard task. In this paper, we adopt an unorthodox approach to the design of such functions. Our search space is the set of functions that possess the required properties. It is “Boolean‐ness” that is evolved.
John A. Clark, Jeremy L. Jacob, Subhamoy Maitra, Pantelimon Stanica   +3 more
openaire   +3 more sources

On learning Boolean functions

Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87, 1987
Robotics ...
openaire   +2 more sources