scientific article; zbMATH DE number 3405843
From MaRDI portal
Publication:5672822
Cited in
(16)- On the Kolmogorov complexity of functions of finite smoothness
- On the average-case complexity of underdetermined functions
- Incomparable integrals and approximate calculation of monotone Boolean functions
- Implementation complexity of Boolean functions with a small number of ones
- Comparing the computational complexity of monomials and elements of finite abelian groups
- Polynomial asymptotically optimal coding of underdetermined Bernoulli sources of the general form
- Revision of asymptotic behavior of the complexity of word assembly by concatenation circuits
- scientific article; zbMATH DE number 3644481 (Why is no real title available?)
- Synthesis of asymptotically size-optimal Boolean circuits protected from functionality inference
- Efficient constructions of hitting sets for systems of linear functions
- \(\mathrm{AC}^0[p]\) lower bounds against MCSP via the coin problem
- THEORETICALLY EFFECTIVE ASYMPTOTICALLY OPTIMAL UNIVERSAL CODING OF PARTIALLY DEFINED SOURCES
- Lupanov's methods and their importance for the formation of circuit synthesis theory
- From Logic to Theoretical Computer Science – An Update
- Average case complexity for finite Boolean functions
- About complexity of implementing threshold functions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5672822)
