Complexity of implementation of Boolean functions by real-valued formulas
From MaRDI portal
Publication:3577253
Recommendations
- Realization of Boolean functions by formulas in continuous bases containing a continuum of constants
- On the complexity of realization of the linear function by formulas over finite Boolean bases
- On the comparison of Boolean bases
- On the complexity of realization of Boolean functions by formulas
- Realization of linear functions by formulas in various bases
Cited in
(15)- On the complexity of computing a random Boolean function over the reals
- Complexity of approximate realizations of Lipschitz functions by schemes in continuous bases
- On the complexity of realization of Boolean functions by formulas
- Complexity of sequential implementation of partial Boolean functions
- The complexity of Boolean function implementation in some classes of automaton circuits
- Complexity of realization of Boolean functions from some classes related to finite grammars by formulas of alternation depth 3
- On the premaximal Boolean bases
- Unsolvability of some problems about piecewise-polynomial functions
- On realization of Boolean functions by formulae without repetitions
- scientific article; zbMATH DE number 5077425 (Why is no real title available?)
- Complexity of implementation of parity functions in the ``implication-negation basis
- Realization of Boolean functions by formulas in continuous bases containing a continuum of constants
- The implementation of certain classes of Boolean functions in iterative networks
- scientific article; zbMATH DE number 5005220 (Why is no real title available?)
- High-accuracy bounds of the Shannon function for formula complexity in bases with direct and iterative variables
This page was built for publication: Complexity of implementation of Boolean functions by real-valued formulas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3577253)
