The following pages link to A. A. Voronenko (Q219285):
Displaying 47 items.
- On the generation of false images of linear \(k\)-valued functions (Q259306) (← links)
- The length of a read-many certificate in the basis of all functions of \(l\) variables (Q260328) (← links)
- On the Shannon function for read-many certificate length in a family of bases (Q264013) (← links)
- On the outcome of false images of linear \(k\)-valued functions for composite numbers \(k\) when the number of variables increases (Q309149) (← links)
- Generation of Boolean functions under the assumption of monotonicity (Q357919) (← links)
- Some test length bounds for nonrepeating functions in the \(\{ \& , \vee \}\) basis (Q616569) (← links)
- Learning read once functions using subcube parity queries (Q694278) (← links)
- On a property of linear Boolean functions (Q822232) (← links)
- Universal functions for linear functions depending on two variables (Q828204) (← links)
- Universal functions for classes of linear functions of three variables (Q830992) (← links)
- Recognizing the nonrepeating property in an arbitrary basis (Q876600) (← links)
- On the generation of false images of linear Boolean functions (Q891129) (← links)
- Testing disjunction as a read-once function in an arbitrary unrepeated basis (Q1037145) (← links)
- On the number of multidimensional monotone extensive mappings (Q1607486) (← links)
- Generation of images of several literals (Q1703521) (← links)
- Existence of universal functions for the class of linear \(k\)-valued functions with moderate \(k\) (Q1705390) (← links)
- Universal functions for classes of Boolean polynomials (Q1706040) (← links)
- Universal functions for classes of bilinear and polylinear Boolean functions (Q1725584) (← links)
- Lower estimate for the cardinality of the domain of universal functions for the class of linear Boolean functions (Q1744294) (← links)
- Iterated Boolean functions in the elementary basis (Q1759196) (← links)
- Estimating the length of a diagnostic test for some nonrepeating functions (Q1777475) (← links)
- On the number of closed multidimensional monotone maps (Q1878736) (← links)
- On the number of closed extensive mappings (Q1878766) (← links)
- Recognizing the presence of a growing unessential argument of Boolean functions (Q1878775) (← links)
- On the conditions of complete asymptotics of the power of function classes of \(k\)-valued logic that preserve the finitary predicate (Q1965358) (← links)
- A new proof of Stetsenko's theorem (Q2018643) (← links)
- Refining the upper bound for the cardinality of the definition domain of universal functions for a class of linear Boolean functions (Q2191017) (← links)
- Conditional testing for Cardot circuits (Q2212732) (← links)
- On testing repetition-free functions (Q2377629) (← links)
- Certificates of Non-Membership for Classes of Read-Once Functions (Q2934873) (← links)
- (Q3013165) (← links)
- (Q3063988) (← links)
- (Q3617448) (← links)
- On some closed classes in partial two-valued logic (Q3835754) (← links)
- On the number of pseudo-Boolean metric functions (Q4809551) (← links)
- (Q4809604) (← links)
- On universal functions for the set of linear functions (Q4917409) (← links)
- (Q5150421) (← links)
- (Q5290945) (← links)
- (Q5445419) (← links)
- (Q5491215) (← links)
- The representability of a Boolean function by a repetition-free formula can be verified by a circuit of linear complexity (Q5491249) (← links)
- The growth of number of discrete Lipschitzian functions under growing dimensions of the domain of their definition (Q5950865) (← links)
- Depth of a conditional full diagnostic test for contact circuits implementing a parity counter (Q6043887) (← links)
- On the universality of product for classes of linear functions of two variables (Q6051970) (← links)
- The existence of universal polynomials for the class of linear functions in even-valued logics (Q6060642) (← links)
- Universal polynomials of several variables for classes of linear functions (Q6545496) (← links)
