The following pages link to (Q4692286):
Displayed 15 items.
- Decomposition representations of logical equations in problems of inversion of discrete functions (Q404200) (← links)
- Upper bounds for the formula size of symmetric Boolean functions (Q465106) (← links)
- Reviewing bounds on the circuit size of the hardest functions (Q1041784) (← links)
- Models of lower-bounds proofs (Q1107322) (← links)
- Algorithms of compacting the knowledge base by sample data (Q1355326) (← links)
- Polynomial asymptotically optimal coding of underdetermined Bernoulli sources of the general form (Q2229580) (← links)
- Estimating the efficiency of threshold representations of Boolean functions (Q4005316) (← links)
- О сложности совместной реализации в базисе ДНФ регулярных систем булевых функций (Q4959000) (← links)
- Maximal k-Intersecting Families of Subsets and Boolean Functions (Q4973228) (← links)
- (Q5146077) (← links)
- IMPROVEMENT OF THE LOWER BOUND FOR THE COMPLEXITY OF EXPONENTIATION (Q5151088) (← links)
- ON AN INVARIANT FOR THE PROBLEM OF UNDERDETERMINED DATA DECOMPOSING (Q5151198) (← links)
- ON THE MEANING OF WORKS BY V. M. KHRAPCHENKO (Q5151450) (← links)
- Transition Function Complexity of Finite Automata (Q5200100) (← links)
- On circuits of functional elements of finite depth of branching (Q5424087) (← links)