D. Yu. Cherukhin

From MaRDI portal
(Redirected from Person:239987)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
The complexity of depth-two information networks
Moscow University Mathematics Bulletin
2015-02-02Paper
Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements
Discrete Mathematics and Applications
2012-03-23Paper
On the informational component in the complexity of a shift operator2012-02-10Paper
On complexity of linear operators on the class of circuits of depth 2
Discrete Mathematics and Applications
2009-10-21Paper
Lower Bounds for Depth-2 and Depth-3 Boolean Circuits with Arbitrary Gates
Computer Science – Theory and Applications
2008-06-05Paper
An algorithmic criterion for the comparison of Boolean bases.2008-03-05Paper
On circuits of functional elements of finite depth of branching
Discrete Mathematics and Applications
2007-11-02Paper
Boolean circuits with a bounded depth of branching
Doklady Mathematics
2007-10-22Paper
scientific article; zbMATH DE number 5077418 (Why is no real title available?)2006-12-05Paper
On the complexity of unitary transformations
Discrete Mathematics and Applications
2004-08-30Paper
On Boolean bases directly preceding the basis \(\{\& ,\vee,\neg\}\).
Doklady Mathematics
2004-06-15Paper
scientific article; zbMATH DE number 1936755 (Why is no real title available?)2003-06-25Paper
Realization of linear functions by formulas in various bases
Moscow University Mathematics Bulletin
2003-04-23Paper
scientific article; zbMATH DE number 1855658 (Why is no real title available?)2003-01-19Paper
scientific article; zbMATH DE number 1746570 (Why is no real title available?)2002-05-28Paper
The complexity hierarchy of Boolean bases
Moscow University Mathematics Bulletin
2002-04-14Paper
On the premaximal Boolean bases
Discrete Mathematics and Applications
2001-09-30Paper
On the complexity of realization of the linear function by formulas over finite Boolean bases
Discrete Mathematics and Applications
2001-07-26Paper
scientific article; zbMATH DE number 1564047 (Why is no real title available?)2001-02-12Paper
scientific article; zbMATH DE number 1564046 (Why is no real title available?)2001-02-12Paper
On the comparison of Boolean bases
Doklady Mathematics
2001-01-28Paper


Research outcomes over time


This page was built for person: D. Yu. Cherukhin