A. V. Chashkin

Available identifiers

zbMath Open chashkin.alexander-vMaRDI QIDQ187705

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q3115553	2012-02-10	Paper
https://portal.mardi4nfdi.de/entity/Q3115626	2012-02-10	Paper
https://portal.mardi4nfdi.de/entity/Q3115632	2012-02-10	Paper
A Note on a priori Estimations of Classification Circuit Complexity	2011-06-10	Paper
Stochastic Algorithms: Foundations and Applications	2009-05-26	Paper
https://portal.mardi4nfdi.de/entity/Q4681895	2005-06-08	Paper
Simulation of circuits of functional elements by the universal Turing machine	2004-10-27	Paper
Average complexity of symmetric Boolean functions	2004-09-07	Paper
Average-case complexity of elementary Boolean functions	2004-08-30	Paper
Local complexity of Boolean functions	2004-01-15	Paper
Average case complexity for finite Boolean functions	2003-02-14	Paper
Lower bounds for the complexity of restrictions of Boolean functions	2003-02-14	Paper
https://portal.mardi4nfdi.de/entity/Q2746911	2001-10-11	Paper
A decomposition of Boolean functions	2001-09-13	Paper
On the realization of linear Boolean operators by straight-line programs with a conditional stop	2001-08-16	Paper
On the mean evaluation of polynomially reducible Boolean functions	2001-07-04	Paper
On the complexity of narrow systems of Boolean vectors	2001-05-14	Paper
On domains completely specifying Boolean functions	2001-01-04	Paper
On lower bounds for the complexity of vector systems of k-valued logic	2001-01-04	Paper
https://portal.mardi4nfdi.de/entity/Q4499532	2000-08-30	Paper
https://portal.mardi4nfdi.de/entity/Q4936630	2000-01-31	Paper
On the Shannon function for the generation of Boolean matrices	1999-07-12	Paper
Average time of computing Boolean operators	1999-05-10	Paper
https://portal.mardi4nfdi.de/entity/Q4242302	1999-05-10	Paper
Self-correcting schemes for functions of polynomial weight	1999-01-14	Paper
On estimates on the complexity of restrictions of Boolean functions	1998-05-23	Paper
On the complexity and depth of circuits that realize partial Boolean functions	1998-01-28	Paper
The complexity of finite graphs	1997-08-20	Paper
https://portal.mardi4nfdi.de/entity/Q4345298	1997-07-22	Paper
The influence of negations on realization complexity of partial monotone Boolean functions	1997-07-13	Paper
On the complexity of restrictions of Boolean functions	1997-03-23	Paper
On the complexity of Boolean matrices, graphs, and the Boolean functions corresponding to them	1995-05-22	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: A. V. Chashkin