The following pages link to A. V. Chashkin (Q187705):
Displayed 34 items.
- Self-correcting schemes for functions of polynomial weight (Q1276026) (← links)
- On the Shannon function for the generation of Boolean matrices (Q1279418) (← links)
- The influence of negations on realization complexity of partial monotone Boolean functions (Q1358553) (← links)
- The complexity of finite graphs (Q1363999) (← links)
- On estimates on the complexity of restrictions of Boolean functions (Q1380287) (← links)
- Towards an algebraic theory of Boolean circuits. (Q1410965) (← links)
- Average complexity of symmetric Boolean functions (Q1878531) (← links)
- Simplified Reed-Muller expressions for residue threshold functions (Q1882415) (← links)
- A decomposition of Boolean functions (Q2708276) (← links)
- (Q2746911) (← links)
- A Note on a priori Estimations of Classification Circuit Complexity (Q3005902) (← links)
- (Q3115553) (← links)
- (Q3115626) (← links)
- (Q3115632) (← links)
- On the complexity of restrictions of Boolean functions (Q3125953) (← links)
- On the complexity of Boolean matrices, graphs, and the Boolean functions corresponding to them (Q3835734) (← links)
- Average time of computing Boolean operators (Q4242300) (← links)
- (Q4242302) (← links)
- (Q4345298) (← links)
- On the complexity and depth of circuits that realize partial Boolean functions (Q4367622) (← links)
- Local complexity of Boolean functions (Q4443562) (← links)
- (Q4499532) (← links)
- On domains completely specifying Boolean functions (Q4522725) (← links)
- On lower bounds for the complexity of vector systems of k-valued logic (Q4522799) (← links)
- On the realization of linear Boolean operators by straight-line programs with a conditional stop (Q4522813) (← links)
- On the complexity of narrow systems of Boolean vectors (Q4522831) (← links)
- (Q4681895) (← links)
- Average-case complexity of elementary Boolean functions (Q4809512) (← links)
- Simulation of circuits of functional elements by the universal Turing machine (Q4825179) (← links)
- (Q4936630) (← links)
- Stochastic Algorithms: Foundations and Applications (Q5901987) (← links)
- On the mean evaluation of polynomially reducible Boolean functions (Q5936693) (← links)
- Average case complexity for finite Boolean functions (Q5954082) (← links)
- Lower bounds for the complexity of restrictions of Boolean functions (Q5954083) (← links)