scientific article

zbMath0663.94002MaRDI QIDQ3815241

S. V. Yablonskij

Publication date: 1986

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

networksalgebra of logicgraphscoding theory

Mathematics Subject Classification ID

Related Items (43)

On a class of decision diagrams ⋮ Characterizations of closed classes of Boolean functions in terms of forbidden subfunctions and Post classes ⋮ Tests of contact closure for contact circuits ⋮ Interpolation and superpositions of multivariate continuous functions ⋮ Short complete diagnostic tests for circuits with one additional input in the standard basis ⋮ On a relation between the depth and complexity of monotone Boolean formulas ⋮ Short complete diagnostic tests for circuits with two additional inputs in some basis ⋮ On the enumeration closure operator in multivalued logic ⋮ Unnamed Item ⋮ Short tests of closures for contact circuits ⋮ Об алгебре и арифметике биномиальных и гауссовых коэффициентов ⋮ Closed classes in the functional system of polynomials with real coefficients ⋮ Short complete diagnostic tests for logic circuits in one infinite basis ⋮ Short complete diagnostic tests for circuits implementing linear Boolean functions ⋮ On classes of functions of many-valued logic with minimal logarithmic growth rate ⋮ On bases of closed classes of Boolean vector functions ⋮ Asymptotic approximation for the number of n-vertex graphs of given diameter ⋮ Unnamed Item ⋮ ON LOWER BOUNDS FOR COMPLEXITY OVER INFINITE BASISES FOR FUNCTIONS OF MULTI-VALUED LOGIC ⋮ SINGLE FAULT DETECTION TESTS FOR LOGIC NETWORKS OF AND, NOT GATES ⋮ A METHOD FOR CONSTRUCTING LOGIC NETWORKS ALLOWING SHORT SINGLE DIAGNOSTIC TESTS ⋮ Lower bounds for the lengths of single tests for Boolean circuits ⋮ Synthesis-analysis of derivation sequences of tables' functional dependences ⋮ On the dependence of the complexity and depth of reversible circuits consisting of NOT, CNOT, and 2-CNOT gates on the number of additional inputs ⋮ On propositional coding techniques for the distinguishability of objects in finite sets ⋮ Minimal complete fault detection tests for circuits of functional elements in standard basis ⋮ The minimal circuits for linear Boolean functions ⋮ Unit checking output tests under constant faults for functional elements ⋮ О строении строго выпуклых $k$-значных функций ⋮ Слои конечного автомата ⋮ О булевых функциях без верхних биюнктивных аналогов ⋮ Bounds on Shannon functions of lengths of contact closure tests for contact circuits ⋮ An efficient algorithm of dead-end controls for solving combinatorial optimization problems ⋮ High-accuracy bounds of the Shannon function for formula complexity in bases with direct and iterative variables ⋮ An algorithm for constructing reduced DNFs of order-convex Boolean functions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On diagnostic tests of contact break for contact circuits ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Short single tests for circuits with arbitrary stuck-at faults at outputs of gates ⋮ Refined bounds on Shannon's function for complexity of circuits of functional elements ⋮ On self-correcting logic circuits of unreliable gates with at most two inputs

This page was built for publication: