Publication:4692286
From MaRDI portal
zbMath0719.68024MaRDI QIDQ4692286
Publication date: 5 June 1993
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items
О сложности совместной реализации в базисе ДНФ регулярных систем булевых функций, Maximal k-Intersecting Families of Subsets and Boolean Functions, Unnamed Item, 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, Transition Function Complexity of Finite Automata, On circuits of functional elements of finite depth of branching, Decomposition representations of logical equations in problems of inversion of discrete functions, Upper bounds for the formula size of symmetric Boolean functions, Reviewing bounds on the circuit size of the hardest functions, Models of lower-bounds proofs, Algorithms of compacting the knowledge base by sample data, Polynomial asymptotically optimal coding of underdetermined Bernoulli sources of the general form, Estimating the efficiency of threshold representations of Boolean functions