The following pages link to Igor S. Sergeev (Q1675518):
Displayed 37 items.
- Item:Q1675518 (redirect page) (← links)
- Upper bounds on the depth of symmetric Boolean functions (Q264012) (← links)
- Complexity and depth of formulas for symmetric Boolean functions (Q334301) (← links)
- Complexity of computation in finite fields (Q378003) (← links)
- Upper bounds for the formula size of symmetric Boolean functions (Q465106) (← links)
- On the additive complexity of GCD and LCM matrices (Q509060) (← links)
- Upper bounds for the size and the depth of formulae for MOD-functions (Q1675519) (← links)
- On the real complexity of a complex DFT (Q1752320) (← links)
- Multilevel representation and complexity of circuits of unbounded fan-in gates (Q2027864) (← links)
- Formula complexity of a linear function in a \(k\)-ary basis (Q2037681) (← links)
- On the complexity of monotone circuits for threshold symmetric Boolean functions (Q2064376) (← links)
- On the complexity of Fibonacci coding (Q2278702) (← links)
- On the complexity of bounded-depth circuits and formulas over the basis of fan-in gates (Q2332856) (← links)
- Fast monotone summation over disjoint sets (Q2446070) (← links)
- The complexity and depth of Boolean circuits for multiplication and inversion in some fields \(\mathrm{GF}(2^{n})\) (Q2513076) (← links)
- Minimal parallel prefix circuits (Q2513242) (← links)
- On the upper bound of the complexity of sorting (Q2662813) (← links)
- On complexity and depth of Boolean circuits for multiplication and inversion over finite fields of characteristic 2 (Q2852140) (← links)
- (Q3115217) (← links)
- (Q3115280) (← links)
- (Q3115628) (← links)
- (Q3115654) (← links)
- (Q3115701) (← links)
- On design of circuits of logarithmic depth for inversion in finite fields (Q3184560) (← links)
- (Q3541480) (← links)
- Fast algorithms for elementary operations on complex power series (Q3586258) (← links)
- (Q3597518) (← links)
- Rectifier Circuits of Bounded Depth (Q4553646) (← links)
- A method for deriving lower bounds for the complexity of monotone arithmetic circuits computing real polynomials (Q4907594) (← links)
- On a relation between the depth and complexity of monotone Boolean formulas (Q5090140) (← links)
- (Q5150372) (← links)
- (Q5150442) (← links)
- ON THE COMPLEXITY OF COMPUTING PRIME TABLES ON THE TURING MACHINE (Q5150729) (← links)
- ON THE MEANING OF WORKS BY V. M. KHRAPCHENKO (Q5151450) (← links)
- An application of the method of additive chains to inversion in finite fields (Q5424089) (← links)
- On constructing circuits for transforming the polynomial and normal bases of finite fields from one to the other (Q5439060) (← links)
- An explicit finite $B_k$-sequence (Q6432503) (← links)