scientific article; zbMATH DE number 3405843
From MaRDI portal
Publication:5672822
zbMath0256.94043MaRDI QIDQ5672822
Publication date: 1965
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (16)
On the Kolmogorov complexity of functions of finite smoothness ⋮ Efficient constructions of Hitting Sets for systems of linear functions ⋮ Revision of asymptotic behavior of the complexity of word assembly by concatenation circuits ⋮ On the average-case complexity of underdetermined functions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Incomparable integrals and approximate calculation of monotone Boolean functions ⋮ Polynomial asymptotically optimal coding of underdetermined Bernoulli sources of the general form ⋮ THEORETICALLY EFFECTIVE ASYMPTOTICALLY OPTIMAL UNIVERSAL CODING OF PARTIALLY DEFINED SOURCES ⋮ About complexity of implementing threshold functions ⋮ Unnamed Item ⋮ Average case complexity for finite Boolean functions ⋮ From Logic to Theoretical Computer Science – An Update ⋮ Implementation complexity of Boolean functions with a small number of ones ⋮ Синтез асимптотически оптимальных по сложности схем из функциональных элементов, защищенных от раскрытия функциональности ⋮ Comparing the computational complexity of monomials and elements of finite abelian groups
This page was built for publication:
