The following pages link to (Q3898440):
Displayed 8 items.
- The circuit complexity of checking polynomiality for functions over residue ring modulo a composite number is linear (Q357917) (← links)
- Inductive representations of Boolean functions and the finite generation of the Post classes (Q760427) (← links)
- Existence of finite bases in closed classes of Boolean functions (Q760428) (← links)
- Extremal broadcasting problems (Q1120554) (← links)
- A polynomial decomposition of Boolean functions (Q1326027) (← links)
- Complexity of Boolean functions in intelligent systems for synthesis of digital integrated circuits (Q1946416) (← links)
- Gauge-equivalent deformations of linear ordinary differential operators with constant coefficients (Q2567679) (← links)
- Number of three-valued logic functions to correct sets of incorrect algorithms and the complexity of interpretation of the functions (Q3888528) (← links)