scientific article; zbMATH DE number 3422274
From MaRDI portal
Publication:5684583
Cited in
(6)- On the depth of \(k\)-valued logic functions over arbitrary bases
- On the dependence of the complexity and depth of reversible circuits consisting of NOT, CNOT, and 2-CNOT gates on the number of additional inputs
- Asymptotical behaviour of some non-uniform measures
- ON LOWER BOUNDS FOR COMPLEXITY OVER INFINITE BASISES FOR FUNCTIONS OF MULTI-VALUED LOGIC
- On the behavior of the Shannon function for the depth of Boolean functions in the standard basis
- Languages of words of low automatic complexity are hard to compute
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 Q5684583)
