Complexity of implementation of Boolean functions by real formulas
From MaRDI portal
Publication:3577253
DOI10.3103/S0027132208020083zbMath1212.06032OpenAlexW2118547316MaRDI QIDQ3577253
Sergey B. Gashkov, Ya. V. Vegner
Publication date: 21 July 2010
Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3103/s0027132208020083
Related Items (3)
Unsolvability of some problems about piecewise-polynomial functions ⋮ Complexity of approximate realizations of Lipschitz functions by schemes in continuous bases ⋮ Realization of Boolean functions by formulas in continuous bases containing a continuum of constants
This page was built for publication: Complexity of implementation of Boolean functions by real formulas
