Certaines Équations Fonctionnelles Pesudo-Booléennes Généralisées
Certaines équations fonctionnelles pseudo-booléennes généralisées.
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...
Conjunctively polynomial-like Boolean functions.
Construction de mots circulaires aléatoires uniformément distribués
Convergence properties of adaptive threshold elements in respect to application and implementation