On the complexity of realization of Boolean functions by formulas
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4187721
- Complexity of implementation of Boolean functions by real-valued formulas
- On the complexity of realization of the linear function by formulas over finite Boolean bases
- scientific article; zbMATH DE number 919269
- scientific article; zbMATH DE number 4031581
Cited in
(23)- Realization of Boolean formulas by uniform multiplexor and majority cascades
- On complexity of computation of partial derivatives of Boolean functions realized by Zhegalkin polynomials
- Realization of Boolean functions by formulas in continuous bases containing a continuum of constants
- Complexity of realization of Boolean functions from some classes related to finite grammars by formulas of alternation depth 3
- On the implementation of monotone Boolean functions by memoryless programs
- On the minimization of complexity and automation of efficient representation of Boolean functions in classes of formulas and circuits
- On the complexity of the evaluation of transient extensions of Boolean functions
- scientific article; zbMATH DE number 6004901 (Why is no real title available?)
- scientific article; zbMATH DE number 5005220 (Why is no real title available?)
- scientific article; zbMATH DE number 5077425 (Why is no real title available?)
- scientific article; zbMATH DE number 5139037 (Why is no real title available?)
- Complexity of implementation of Boolean functions by real-valued formulas
- scientific article; zbMATH DE number 3922538 (Why is no real title available?)
- scientific article; zbMATH DE number 15477 (Why is no real title available?)
- scientific article; zbMATH DE number 2123423 (Why is no real title available?)
- On realization of Boolean functions by formulae without repetitions
- Finding the subsets of variables of a partial Boolean function which are sufficient for its implementation in the classes defined by predicates
- Computation of the additivity coefficient of some bijunctive, weakly positive and weakly negative Boolean functions
- scientific article; zbMATH DE number 3394051 (Why is no real title available?)
- scientific article; zbMATH DE number 4187721 (Why is no real title available?)
- Complexity of automata computing values of functions given in the prefix form
- Chair of Discrete Mathematics
- Computational complexity of quantified Boolean formulas with fixed maximal deficiency
This page was built for publication: On the complexity of realization of Boolean functions by formulas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3115553)
