The following pages link to (Q5672822):
Displaying 16 items.
- About complexity of implementing threshold functions (Q682325) (← links)
- On the Kolmogorov complexity of functions of finite smoothness (Q1080660) (← links)
- On the average-case complexity of underdetermined functions (Q1669577) (← links)
- Incomparable integrals and approximate calculation of monotone Boolean functions (Q1703194) (← links)
- Implementation complexity of Boolean functions with a small number of ones (Q2050236) (← links)
- Comparing the computational complexity of monomials and elements of finite abelian groups (Q2088733) (← links)
- Polynomial asymptotically optimal coding of underdetermined Bernoulli sources of the general form (Q2229580) (← links)
- Revision of asymptotic behavior of the complexity of word assembly by concatenation circuits (Q2628763) (← links)
- (Q3049813) (← links)
- Синтез асимптотически оптимальных по сложности схем из функциональных элементов, защищенных от раскрытия функциональности (Q3381881) (← links)
- Efficient constructions of Hitting Sets for systems of linear functions (Q5048940) (← links)
- (Q5091223) (← links)
- THEORETICALLY EFFECTIVE ASYMPTOTICALLY OPTIMAL UNIVERSAL CODING OF PARTIALLY DEFINED SOURCES (Q5151434) (← links)
- (Q5239716) (← links)
- From Logic to Theoretical Computer Science – An Update (Q5452171) (← links)
- Average case complexity for finite Boolean functions (Q5954082) (← links)
