Zobrazeno 1 - 10
of 21
pro vyhledávání: '"A. V. Chashkin"'
Autor:
A. V. Chashkin
Publikováno v:
Moscow University Mathematics Bulletin. 77:136-143
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8d37f9041028b761201caa8cf1cf9990
https://doi.org/10.3103/s0027132222030056
https://doi.org/10.3103/s0027132222030056
Autor:
Aleksandr V. Chashkin
Publikováno v:
Discrete Mathematics and Applications. 31:315-318
Given a binomial probability distribution on the n-dimensional Boolean cube, the complexity of implementation of Boolean functions by straight line programs with conditional stop is considered. The order, as n → ∞, of the average-case complexity
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f7a4058bc876b7f85c5f85d8e633db66
https://doi.org/10.1515/dma-2021-0028
https://doi.org/10.1515/dma-2021-0028
Autor:
Aleksandr V. Chashkin
Publikováno v:
Discrete Mathematics and Applications. 28:201-221
The average-case complexity of computation of underdetermined functions by straight-line programs with conditional stop over the basis of all at most two-place Boolean functions is considered. Correct order estimates of the average-case complexity of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fa6d7292bd673d5cb9493f9cddbfccab
https://doi.org/10.1515/dma-2018-0019
https://doi.org/10.1515/dma-2018-0019
Autor:
Aleksandr V. Chashkin
Publikováno v:
Discrete Mathematics and Applications. 27:137-142
We consider average-case complexity of computing monotone Boolean functions by straight-line programs with a conditional stop over the basis of all Boolean functions of at most two variables. For the set of all n-ary monotone Boolean functions new Sh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9287b275db615691bf4efa968d8a9a16
https://doi.org/10.1515/dma-2017-0017
https://doi.org/10.1515/dma-2017-0017
Autor:
A. V. Chashkin
Publikováno v:
Moscow University Mathematics Bulletin. 72:102-106
The mean computing time for computation of values of Boolean operators by straight-line programs with a conditional stop and the storage of at most D is studied. An asymptotically exact formula for the mean computation time is obtained for growing nu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c3fcea0799f14d6a7a055e0452954eeb
https://doi.org/10.3103/s0027132217030032
https://doi.org/10.3103/s0027132217030032
Autor:
A. V. Chashkin
Publikováno v:
Lobachevskii Journal of Mathematics. 36:466-473
Linear operators injective on subsets of a linear space over GF(p) are considered. It is shown that, given any positive constant e, any sufficiently large n, and any domain D in GFn(p), there exists a linear operator injective on this domain whose ra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e38006fb227638989c7a83556db26534
https://doi.org/10.1134/s1995080215040228
https://doi.org/10.1134/s1995080215040228
Autor:
Alexander V. Chashkin, Andreas Alexander Albrecht, Georgios Lappas, Kathleen Steinhöfel, O. M. Kasim-Zade, Costas S. Iliopoulos
Publikováno v:
Fundamenta Informaticae. 104:201-217
The paper aims at tight upper bounds on the size of pattern classification circuits that can be used for a priori parameter settings in a machine learning context. The upper bounds relate the circuit size S(C) to nL := [log2mL], where mL is the numbe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::11b8d821db8132ebccd40df962f1ebd2
https://doi.org/10.3233/fi-2010-344
https://doi.org/10.3233/fi-2010-344
Autor:
A. V. Chashkin
Publikováno v:
Moscow University Mathematics Bulletin. 62:119-123
A realization of graphs with vertices of bounded branching in a subspace of bounded depth is considered. A volume order inside of which an arbitrary graph can be realized is determined.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::023b00793b784a0f521b3747bc833a20
https://doi.org/10.3103/s0027132207030084
https://doi.org/10.3103/s0027132207030084
Autor:
A. V. Chashkin
Publikováno v:
Journal of Applied and Industrial Mathematics. 1:175-177
The complexity of implementing a cyclic shift of a 2n-tuple of real numbers by Boolean circuits over the basis consisting of a ternary choice function and all binary Boolean functions is shown to be 2nn.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fa1807053a0a8f2533386f4474aceb8f
https://doi.org/10.1134/s199047890702007x
https://doi.org/10.1134/s199047890702007x
Autor:
A. V. Chashkin
Publikováno v:
Discrete Mathematics and Applications. 14
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::077681cbf8470da260e4766a389bf6ad
https://doi.org/10.1515/1569392031905557
https://doi.org/10.1515/1569392031905557