The following pages link to Sergey B. Gashkov (Q314123):
Displaying 50 items.
- Arithmetic complexity of the Stirling transforms (Q314124) (← links)
- Complexity of computation in finite fields (Q378003) (← links)
- (Q509059) (redirect page) (← links)
- On the additive complexity of GCD and LCM matrices (Q509060) (← links)
- On the application of linear positive operators for approximation of functions (Q520576) (← links)
- (Q755839) (redirect page) (← links)
- Ein einfacher geometrischer Beweis für die Determinantenungleichung von O. Szasz. (Simple geometrical proof of the determinant inequality of O. Szasz) (Q755841) (← links)
- On the complexity of approximate realization of analytic functions by networks and formulas (Q794624) (← links)
- On parallel evaluation of certain classes of polynomials with an increasing number of variables (Q804282) (← links)
- Complexity of approximate realization of functions, satisfying the Lipschitz condition, by schemes in continuous bases (Q920326) (← links)
- On the complexity of the approximate realization of certain classes of differentiable functions of one variable by formulas in certain continuous bases (Q1071981) (← links)
- Complexity of approximate realization of some classes of differentiable functions of one variable by schemes of functional elements (Q1080100) (← links)
- The complexity of approximate ``scheme and formula'' realization of continuous functions and continual analogues of ``Shannon's effect'' (Q1094079) (← links)
- The complexity of monotone computations of polynomials (Q1109563) (← links)
- On the complexity of the computation of certain classes of polynomials of several variables (Q1111380) (← links)
- On the complexity of approximate realization for classes of functions of several variables by schemes and formulas in bases of continuous functions (Q1117414) (← links)
- On the complexity of the approximation of functions with given moduli of continuity of the first and second orders in some piecewise linear and polynomial bases (Q1358544) (← links)
- ``Curse of dimensionality'' for complexity of approximation for classes of functions satisfying Lipschitz condition (Q1377427) (← links)
- Fast algorithm of square rooting in some finite fields of odd characteristic (Q1725540) (← links)
- On the complexity of approximate realization of some classical functions (Q1920136) (← links)
- Complexity of approximate realizations of Lipschitz functions by schemes in continuous bases (Q1938623) (← links)
- Realization of Boolean functions by formulas in continuous bases containing a continuum of constants (Q1938644) (← links)
- A note on the fast computation of transitive closure of graphs and the multiplication of integer matrices (Q2027889) (← links)
- The complexity of solving low degree equations over ring of integers and residue rings (Q2319973) (← links)
- Arithmetic complexity of certain linear transformations (Q2352607) (← links)
- The arithmetic computational complexity of linear transforms (Q2356497) (← links)
- On hardware and software implementation of arithmetic in finite fields of characteristic 7 for calculation of pairings (Q2453385) (← links)
- Berlekamp-Massey algorithm, continued fractions, Padé approximations, and orthogonal polynomials (Q2473633) (← links)
- Complexity of approximation of Lipschitz functions (Q2512997) (← links)
- The complexity and depth of Boolean circuits for multiplication and inversion in some fields \(\mathrm{GF}(2^{n})\) (Q2513076) (← links)
- Fast algorithms for solving equations of degree \(\le 4\) in some finite fields (Q2666933) (← links)
- On fast multiplication of polynomials, the Fourier and Hartley transforms (Q2708303) (← links)
- On complexity and depth of Boolean circuits for multiplication and inversion over finite fields of characteristic 2 (Q2852140) (← links)
- (Q2857861) (← links)
- Vladimir Nikolaevich Chubarikov (on his 60th birthday) (Q2892032) (← links)
- (Q3005904) (← links)
- (Q3115217) (← links)
- (Q3115626) (← links)
- (Q3115628) (← links)
- (Q3115701) (← links)
- On design of circuits of logarithmic depth for inversion in finite fields (Q3184560) (← links)
- (Q3205168) (← links)
- (Q3212286) (← links)
- (Q3218068) (← links)
- (Q3499664) (← links)
- (Q3541510) (← links)
- Complexity of implementation of Boolean functions by real formulas (Q3577253) (← links)
- (Q3597518) (← links)
- (Q3704345) (← links)
- (Q3757243) (← links)
