scientific article; zbMATH DE number 3354614
From MaRDI portal
Publication:5629239
Cited in
(18)- Fourier concentration from shrinkage
- \(\mathrm P \overset {?} {=} \mathrm{NP}\)
- The circuit depth of symmetric Boolean functions
- Complexity of the realization of a linear Boolean function in the class of -schemes
- Smallest formulas for the parity of \(2^k\) variables are essentially unique
- On algorithm complexity
- Algorithms and lower bounds for comparator circuits from shrinkage
- Shallow circuits and concise formulae for multiple addition and multiplication
- On the structure of one class of perfect \(\Pi \)-partitions
- Sufficient conditions for the local repetition-freeness of minimal -schemes realizing linear Boolean functions
- Upper bounds for the formula size of symmetric Boolean functions
- Quantified Derandomization: How to Find Water in the Ocean
- Smallest Formulas for Parity of 2 k Variables Are Essentially Unique
- The complexity of the realization of symmetrical functions by formulae
- On the perfectness of minimal regular partitions of the edge set of the n-dimensional cube
- On the meaning of works by V. M. Khrapchenko
- Improved average-case lower bounds for De Morgan formula size: matching worst-case lower bound
- Lower bounds for the size of expressions for certain functions in d-ary logic
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 Q5629239)
