Certaines Équations Fonctionnelles Pesudo-Booléennes Généralisées
Certaines équations fonctionnelles pseudo-booléennes généralisées.
Characterization of generic properties of linear structured systems for efficient computations
In this paper we investigate some of the computational aspects of generic properties of linear structured systems. In such systems only the zero/nonzero pattern of the system matrices is assumed to be known. For structured systems a number of characterizations of so-called generic properties have been obtained in the literature. The characterizations often have been presented by means of the graph associated to a linear structured system and are then expressed in terms of the maximal or minimal...
Circuit lower bounds and linear codes.
Closed-loop stability of discrete linear single-variable systems
Combined complexity classes for finite functions
Comment on “Convergence properties of adaptive threshold elements...”
Complexity theoretical results on nondeterministic graph-driven read-once branching programs
Branching programs are a well-established computation model for boolean functions, especially read-once branching programs (BP1s) have been studied intensively. Recently two restricted nondeterministic (parity) BP1 models, called nondeterministic (parity) graph-driven BP1s and well-structured nondeterministic (parity) graph-driven BP1s, have been investigated. The consistency test for a BP-model is the test whether a given BP is really a BP of model . Here it is proved that the consistency test...
Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs
Branching programs are a well-established computation model for boolean functions, especially read-once branching programs (BP1s) have been studied intensively. Recently two restricted nondeterministic (parity) BP1 models, called nondeterministic (parity) graph-driven BP1s and well-structured nondeterministic (parity) graph-driven BP1s, have been investigated. The consistency test for a BP-model M is the test whether a given BP is really a BP of model M. Here it is proved that the consistency...
Computing with the Square Root of NOT
To the two classical reversible 1-bit logic gates, i.e. the identity gate (a.k.a. the follower) and the NOT gate (a.k.a. the inverter), we add an extra gate, the square root of NOT. Similarly, we add to the 24 classical reversible 2-bit circuits, both the square root of NOT and the controlled square root of NOT. This leads to a new kind of calculus, situated between classical reversible computing and quantum computing.
Conjunctively polynomial-like Boolean functions.
Construction de mots circulaires aléatoires uniformément distribués
Construction of codes identifying sets of vertices.
Controllability, applications, and numerical simulations of cellular neural networks.
Controllability of partial differential equations on graphs
We study boundary control problems for the wave, heat, and Schrödinger equations on a finite graph. We suppose that the graph is a tree (i.e., it does not contain cycles), and on each edge an equation is defined. The control is acting through the Dirichlet condition applied to all or all but one boundary vertices. Exact controllability in L₂-classes of controls is proved and sharp estimates of the time of controllability are obtained for the wave equation. Null controllability for the heat equation...
Controllability of time-varying cellular neural networks.
Convergence properties of adaptive threshold elements in respect to application and implementation
Costruzione di un universo di dispositivi non lineari su una coppia di gruppi abeliani