Results 251 to 260 of about 2,786,322 (296)

Intelligent tool orchestration for rapid mechanistic model prototyping: MCP servers as AI-biology interfaces. [PDF]

NPJ Syst Biol Appl
Ruscone M, Vazquez M, Valencia A.
europepmc   +1 more source

Dynamics of attractor transitions in Boolean networks under noise. [PDF]

Chaos
Min B, Choi J, Laubenbacher R.
europepmc   +1 more source

MicroRNA circuits and regulatory networks: emerging therapeutic paradigm. [PDF]

RNA Biol
Goswami S, Singh S.
europepmc   +1 more source

All-optical logic processing unit using Kerr nonlinearity of MXene. [PDF]

Nat Commun
Ge Y, Wang W, Wang M, Zhang S, Zhong Y, Zhang Y, Wei S, Du B, Wang H, Qiu M, Liu G, Zhang L, Li J, Yue Y, Zhang H.   +14 more
europepmc   +1 more source

Modeling of gene regulatory networks: an annotated glossary. [PDF]

Trends Plant Sci
Singh Yadav A, Russell NJ, Hernández AI, Petlewski AR, Johnson AR, Grinage AD, Banuna B, Guan CJ, Mahood EH, Younkin GC, Thomas HR, Phillips HR, Harline K, Flasco M, Miller MB, Scinto-Madonich NJ, Szeluga NM, Mendoza PN, Formosa-Jordan P, Roeder AHK.   +19 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:

Almost Boolean Functions: The Design of Boolean Functions by Spectral Inversion

Computational Intelligence, 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.
Subhamoy Maitra, Pantelimon Stanica, John Clark   +2 more
exaly   +4 more sources

Möbius transforms, coincident Boolean functions and non-coincidence property of Boolean functions

International Journal of Computer Mathematics, 2011
Boolean functions and their Möbius transforms are involved in logical calculation, digital communications, coding theory and modern cryptography. So far, little is known about the relations of Boolean functions and their Möbius transforms.
Josef Pieprzyk, Huaxiong Wang, Xian-Mo Zhang   +2 more
exaly   +2 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