scientific article; zbMATH DE number 194333
From MaRDI portal
Publication:4692286
zbMath0719.68024MaRDI QIDQ4692286
Publication date: 5 June 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (15)
Algorithms of compacting the knowledge base by sample data ⋮ Models of lower-bounds proofs ⋮ Estimating the efficiency of threshold representations of Boolean functions ⋮ Decomposition representations of logical equations in problems of inversion of discrete functions ⋮ Upper bounds for the formula size of symmetric Boolean functions ⋮ Polynomial asymptotically optimal coding of underdetermined Bernoulli sources of the general form ⋮ IMPROVEMENT OF THE LOWER BOUND FOR THE COMPLEXITY OF EXPONENTIATION ⋮ ON AN INVARIANT FOR THE PROBLEM OF UNDERDETERMINED DATA DECOMPOSING ⋮ ON THE MEANING OF WORKS BY V. M. KHRAPCHENKO ⋮ On circuits of functional elements of finite depth of branching ⋮ Transition Function Complexity of Finite Automata ⋮ О сложности совместной реализации в базисе ДНФ регулярных систем булевых функций ⋮ Maximal k-Intersecting Families of Subsets and Boolean Functions ⋮ Reviewing bounds on the circuit size of the hardest functions ⋮ Unnamed Item
This page was built for publication:
