D. Yu. Cherukhin

Available identifiers

Publication	Date of Publication	Type
The complexity of depth-two information networks	2015-02-02	Paper
Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements	2012-03-23	Paper
https://portal.mardi4nfdi.de/entity/Q3115554	2012-02-10	Paper
On complexity of linear operators on the class of circuits of depth 2	2009-10-21	Paper
Lower Bounds for Depth-2 and Depth-3 Boolean Circuits with Arbitrary Gates	2008-06-05	Paper
https://portal.mardi4nfdi.de/entity/Q5445408	2008-03-05	Paper
On circuits of functional elements of finite depth of branching	2007-11-02	Paper
Boolean circuits with a bounded depth of branching	2007-10-22	Paper
https://portal.mardi4nfdi.de/entity/Q3412385	2006-12-05	Paper
On the complexity of unitary transformations	2004-08-30	Paper
On Boolean bases directly preceding the basis \(\{\& ,\vee,\neg\}\).	2004-06-15	Paper
https://portal.mardi4nfdi.de/entity/Q4406622	2003-06-25	Paper
Realization of linear functions by formulas in various bases	2003-04-23	Paper
https://portal.mardi4nfdi.de/entity/Q4788068	2003-01-19	Paper
https://portal.mardi4nfdi.de/entity/Q4530739	2002-05-28	Paper
The complexity hierarchy of Boolean bases	2002-04-14	Paper
On the premaximal Boolean bases	2001-09-30	Paper
On the complexity of realization of the linear function by formulas over finite Boolean bases	2001-07-26	Paper
https://portal.mardi4nfdi.de/entity/Q4528867	2001-02-12	Paper
https://portal.mardi4nfdi.de/entity/Q4528866	2001-02-12	Paper
On the comparison of Boolean bases	2001-01-28	Paper

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