scientific article; zbMATH DE number 3354614
From MaRDI portal
Publication:5629239
zbMATH Open0223.68009MaRDI QIDQ5629239FDOQ5629239
Authors: V. M. Khrapchenko 
Publication date: 1971
Full work available at URL: http://mathnet.ru/eng/mz/v10/i1/p83
Title of this publication is not available (Why is that?)
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 \(\pi\)-schemes
- Smallest formulas for the parity of \(2^k\) variables are essentially unique
- Algorithms and lower bounds for comparator circuits from shrinkage
- On algorithm complexity
- On the structure of one class of perfect \(\Pi \)-partitions
- Shallow circuits and concise formulae for multiple addition and multiplication
- Sufficient conditions for the local repetition-freeness of minimal \(\pi\)-schemes realizing linear Boolean functions
- Quantified Derandomization: How to Find Water in the Ocean
- Upper bounds for the formula size of symmetric Boolean functions
- 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)
