scientific article; zbMATH DE number 3121508
From MaRDI portal
Publication:3236503
zbMATH Open0072.43204MaRDI QIDQ3236503FDOQ3236503
Authors: O. B. Lupanov 
Publication date: 1956
Title of this publication is not available (Why is that?)
Cited In (20)
- Comparing the sizes of nondeterministic branching read-k-times programs
- The complexity of the realization of subdefinite matrices by gate schemes
- Separating OR, SUM, and XOR circuits
- On various nonlinearity measures for Boolean functions
- Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs
- Improved upper bounds for the expected circuit complexity of dense systems of linear equations over \(\mathrm{GF}(2)\)
- On algorithm complexity
- Efficient Construction of Rigid Matrices Using an NP Oracle
- A note on the fast computation of transitive closure of graphs and the multiplication of integer matrices
- On the complexity of bounded-depth circuits and formulas over the basis of fan-in gates
- Rectifier circuits of bounded depth
- Optimal bounds for the approximation of Boolean functions and some applications
- Biclique covers and partitions
- Cancellation-free circuits in unbounded and bounded depth
- Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs
- Calculating optimal addition chains
- On weak keys and forgery attacks against polynomial-based MAC schemes
- Complexity of computation in finite fields
- Correcting closures in contact circuits
- On the number of ANDs versus the number of ORs in monotone Boolean circuits
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 Q3236503)
