scientific article; zbMATH DE number 3205680
From MaRDI portal
Publication:5333608
Cited in
(14)- Lower bounds on the area complexity of Boolean circuits
- Zwei lineare untere Schranken für die Komplexität Boolescher Funktionen
- A sequence of complexly computable functions
- Characteristic measures of switching functions
- On some measures of complexity of finite abelian groups
- The complexity of pseudo-linear functions
- Complexity of functions from some classes of three-valued logic
- Determination of systems of graphs and the synthesis of finite automata
- Berechnungen in partiellen Algebren endlichen Typs
- Complexity of realization by formulas of special form for functions of multivalued logic
- Depth of functions of \(k\)-valued logic in finite bases
- Average time of computing Boolean operators
- On the computation complexity of the systems of finite abelian group elements
- Chair of Discrete Mathematics
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 Q5333608)
