scientific article; zbMATH DE number 3225719
From MaRDI portal
Publication:5514082
Cited in
(11)- Single-fault diagnostic tests for coalescences of variables in Boolean functions
- Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs
- Polynomial asymptotically optimal coding of underdetermined Bernoulli sources of the general form
- Optimal bounds for the approximation of Boolean functions and some applications
- Sparse Boolean equations and circuit lattices
- On the complexity of gradient gate circuits
- On the average-case complexity of underdetermined functions
- The complexity of the descriptiveness of Boolean circuits over different sets of gates
- Representing \((0,1)\)-matrices by Boolean circuits
- THEORETICALLY EFFECTIVE ASYMPTOTICALLY OPTIMAL UNIVERSAL CODING OF PARTIALLY DEFINED SOURCES
- scientific article; zbMATH DE number 3745100 (Why is no real title available?)
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 Q5514082)
